./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c12b3d893de05137a4e7e0aa006fe67a43cc9e3d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 15:23:09,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:23:09,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:23:09,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:23:09,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:23:09,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:23:09,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:23:09,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:23:09,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:23:09,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:23:09,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:23:09,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:23:09,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:23:09,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:23:09,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:23:09,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:23:09,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:23:09,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:23:09,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:23:09,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:23:09,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:23:09,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:23:09,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:23:09,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:23:09,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:23:09,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:23:09,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:23:09,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:23:09,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:23:09,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:23:09,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:23:09,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:23:09,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:23:09,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:23:09,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:23:09,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:23:09,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:23:09,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:23:09,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:23:09,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:23:09,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:23:09,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-12-01 15:23:09,717 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:23:09,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:23:09,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:23:09,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:23:09,719 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:23:09,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:23:09,719 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:23:09,720 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-01 15:23:09,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:23:09,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:23:09,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:23:09,721 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-01 15:23:09,721 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-01 15:23:09,721 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-01 15:23:09,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:23:09,722 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-01 15:23:09,722 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:23:09,722 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:23:09,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:23:09,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:23:09,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:23:09,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:23:09,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:23:09,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:23:09,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:23:09,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:23:09,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:23:09,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:23:09,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c12b3d893de05137a4e7e0aa006fe67a43cc9e3d [2020-12-01 15:23:10,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:23:10,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:23:10,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:23:10,050 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:23:10,051 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:23:10,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2020-12-01 15:23:10,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/data/0d360f82b/345eebd023004c568e4a3fd2de0d2ac5/FLAGa6e0124b2 [2020-12-01 15:23:10,922 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:23:10,923 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2020-12-01 15:23:10,946 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/data/0d360f82b/345eebd023004c568e4a3fd2de0d2ac5/FLAGa6e0124b2 [2020-12-01 15:23:11,106 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/data/0d360f82b/345eebd023004c568e4a3fd2de0d2ac5 [2020-12-01 15:23:11,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:23:11,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-12-01 15:23:11,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:23:11,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:23:11,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:23:11,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:11,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cc671f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11, skipping insertion in model container [2020-12-01 15:23:11,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:11,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:23:11,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:23:11,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:23:11,778 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:23:11,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:23:11,953 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:23:11,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11 WrapperNode [2020-12-01 15:23:11,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:23:11,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:23:11,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:23:11,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:23:11,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:11,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:12,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:12,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:12,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:12,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:12,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... [2020-12-01 15:23:12,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:23:12,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:23:12,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:23:12,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:23:12,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:23:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-12-01 15:23:12,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:23:12,241 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-12-01 15:23:12,241 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-12-01 15:23:12,242 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-12-01 15:23:12,242 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2020-12-01 15:23:12,243 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2020-12-01 15:23:12,243 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2020-12-01 15:23:12,243 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2020-12-01 15:23:12,244 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2020-12-01 15:23:12,244 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2020-12-01 15:23:12,245 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2020-12-01 15:23:12,245 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2020-12-01 15:23:12,245 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2020-12-01 15:23:12,245 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2020-12-01 15:23:12,245 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2020-12-01 15:23:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2020-12-01 15:23:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2020-12-01 15:23:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2020-12-01 15:23:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2020-12-01 15:23:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-12-01 15:23:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-12-01 15:23:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-12-01 15:23:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-12-01 15:23:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2020-12-01 15:23:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-12-01 15:23:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-12-01 15:23:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-12-01 15:23:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:23:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-12-01 15:23:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-12-01 15:23:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-12-01 15:23:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2020-12-01 15:23:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2020-12-01 15:23:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2020-12-01 15:23:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2020-12-01 15:23:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2020-12-01 15:23:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2020-12-01 15:23:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2020-12-01 15:23:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2020-12-01 15:23:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2020-12-01 15:23:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2020-12-01 15:23:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2020-12-01 15:23:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2020-12-01 15:23:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2020-12-01 15:23:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2020-12-01 15:23:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2020-12-01 15:23:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-12-01 15:23:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-12-01 15:23:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-12-01 15:23:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-12-01 15:23:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2020-12-01 15:23:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-12-01 15:23:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-12-01 15:23:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-12-01 15:23:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2020-12-01 15:23:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2020-12-01 15:23:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-12-01 15:23:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-12-01 15:23:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-12-01 15:23:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-12-01 15:23:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:23:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:23:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:23:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-01 15:23:12,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:23:12,907 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:12,988 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2020-12-01 15:23:12,988 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2020-12-01 15:23:12,994 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,047 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2020-12-01 15:23:13,048 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2020-12-01 15:23:13,073 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,114 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-12-01 15:23:13,114 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-12-01 15:23:13,208 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,304 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2020-12-01 15:23:13,305 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: #res := 0; [2020-12-01 15:23:13,306 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2020-12-01 15:23:13,310 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,533 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2020-12-01 15:23:13,534 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2020-12-01 15:23:13,535 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,577 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2020-12-01 15:23:13,577 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2020-12-01 15:23:13,633 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,665 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2020-12-01 15:23:13,665 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2020-12-01 15:23:13,671 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,903 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2020-12-01 15:23:13,903 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2020-12-01 15:23:13,919 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:23:13,924 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-12-01 15:23:13,925 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-12-01 15:23:13,980 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:23:13,980 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-12-01 15:23:13,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:23:13 BoogieIcfgContainer [2020-12-01 15:23:13,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:23:13,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:23:13,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:23:13,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:23:13,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:23:11" (1/3) ... [2020-12-01 15:23:13,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513ca658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:23:13, skipping insertion in model container [2020-12-01 15:23:13,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:23:11" (2/3) ... [2020-12-01 15:23:13,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513ca658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:23:13, skipping insertion in model container [2020-12-01 15:23:13,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:23:13" (3/3) ... [2020-12-01 15:23:13,998 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2020-12-01 15:23:14,012 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:23:14,018 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 15:23:14,029 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-01 15:23:14,059 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:23:14,060 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-01 15:23:14,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:23:14,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:23:14,060 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:23:14,060 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:23:14,060 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:23:14,061 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:23:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states. [2020-12-01 15:23:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 15:23:14,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:14,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:14,117 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -421282280, now seen corresponding path program 1 times [2020-12-01 15:23:14,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:14,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280077713] [2020-12-01 15:23:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:14,593 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:23:14,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:14,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:14,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280077713] [2020-12-01 15:23:14,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:14,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:23:14,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800614680] [2020-12-01 15:23:14,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:23:14,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:23:14,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:23:14,751 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 4 states. [2020-12-01 15:23:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:17,734 INFO L93 Difference]: Finished difference Result 670 states and 1028 transitions. [2020-12-01 15:23:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:23:17,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-01 15:23:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:17,774 INFO L225 Difference]: With dead ends: 670 [2020-12-01 15:23:17,777 INFO L226 Difference]: Without dead ends: 664 [2020-12-01 15:23:17,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:23:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-12-01 15:23:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 508. [2020-12-01 15:23:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2020-12-01 15:23:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 739 transitions. [2020-12-01 15:23:17,970 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 739 transitions. Word has length 15 [2020-12-01 15:23:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:17,970 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 739 transitions. [2020-12-01 15:23:17,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:23:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 739 transitions. [2020-12-01 15:23:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:23:17,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:17,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:17,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:23:17,974 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1437237362, now seen corresponding path program 1 times [2020-12-01 15:23:17,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:17,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465869902] [2020-12-01 15:23:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:18,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:18,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:18,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465869902] [2020-12-01 15:23:18,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:18,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:23:18,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773810757] [2020-12-01 15:23:18,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:23:18,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:23:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:23:18,305 INFO L87 Difference]: Start difference. First operand 508 states and 739 transitions. Second operand 5 states. [2020-12-01 15:23:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:21,690 INFO L93 Difference]: Finished difference Result 669 states and 1020 transitions. [2020-12-01 15:23:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:23:21,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-12-01 15:23:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:21,705 INFO L225 Difference]: With dead ends: 669 [2020-12-01 15:23:21,705 INFO L226 Difference]: Without dead ends: 664 [2020-12-01 15:23:21,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:23:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-12-01 15:23:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 508. [2020-12-01 15:23:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2020-12-01 15:23:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2020-12-01 15:23:21,761 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 21 [2020-12-01 15:23:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:21,761 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2020-12-01 15:23:21,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:23:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2020-12-01 15:23:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 15:23:21,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:21,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:21,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:23:21,764 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1954568209, now seen corresponding path program 1 times [2020-12-01 15:23:21,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:21,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873033594] [2020-12-01 15:23:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:21,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:22,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:22,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:22,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873033594] [2020-12-01 15:23:22,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:22,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:23:22,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239863046] [2020-12-01 15:23:22,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:23:22,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:23:22,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:23:22,070 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand 6 states. [2020-12-01 15:23:22,203 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-01 15:23:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:25,900 INFO L93 Difference]: Finished difference Result 845 states and 1257 transitions. [2020-12-01 15:23:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:23:25,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-12-01 15:23:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:25,909 INFO L225 Difference]: With dead ends: 845 [2020-12-01 15:23:25,909 INFO L226 Difference]: Without dead ends: 844 [2020-12-01 15:23:25,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:23:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-12-01 15:23:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 663. [2020-12-01 15:23:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2020-12-01 15:23:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 962 transitions. [2020-12-01 15:23:25,969 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 962 transitions. Word has length 26 [2020-12-01 15:23:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:25,969 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 962 transitions. [2020-12-01 15:23:25,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:23:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 962 transitions. [2020-12-01 15:23:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-01 15:23:25,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:25,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:25,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:23:25,980 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash -497384386, now seen corresponding path program 1 times [2020-12-01 15:23:25,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:25,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934910513] [2020-12-01 15:23:25,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:26,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:26,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:26,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:26,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934910513] [2020-12-01 15:23:26,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:26,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:23:26,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484958191] [2020-12-01 15:23:26,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:23:26,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:23:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:23:26,301 INFO L87 Difference]: Start difference. First operand 663 states and 962 transitions. Second operand 6 states. [2020-12-01 15:23:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:29,391 INFO L93 Difference]: Finished difference Result 968 states and 1411 transitions. [2020-12-01 15:23:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:23:29,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-12-01 15:23:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:29,398 INFO L225 Difference]: With dead ends: 968 [2020-12-01 15:23:29,399 INFO L226 Difference]: Without dead ends: 968 [2020-12-01 15:23:29,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:23:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-12-01 15:23:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 788. [2020-12-01 15:23:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-12-01 15:23:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1133 transitions. [2020-12-01 15:23:29,439 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1133 transitions. Word has length 31 [2020-12-01 15:23:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:29,439 INFO L481 AbstractCegarLoop]: Abstraction has 788 states and 1133 transitions. [2020-12-01 15:23:29,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:23:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1133 transitions. [2020-12-01 15:23:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-01 15:23:29,441 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:29,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:29,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:23:29,442 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1792022046, now seen corresponding path program 1 times [2020-12-01 15:23:29,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:29,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779605055] [2020-12-01 15:23:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:29,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:29,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:29,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:29,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779605055] [2020-12-01 15:23:29,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:29,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:23:29,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922586604] [2020-12-01 15:23:29,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:23:29,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:23:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:23:29,666 INFO L87 Difference]: Start difference. First operand 788 states and 1133 transitions. Second operand 6 states. [2020-12-01 15:23:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:33,869 INFO L93 Difference]: Finished difference Result 1342 states and 2027 transitions. [2020-12-01 15:23:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:23:33,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-12-01 15:23:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:33,880 INFO L225 Difference]: With dead ends: 1342 [2020-12-01 15:23:33,880 INFO L226 Difference]: Without dead ends: 1342 [2020-12-01 15:23:33,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:23:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-12-01 15:23:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 906. [2020-12-01 15:23:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-12-01 15:23:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1346 transitions. [2020-12-01 15:23:33,925 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1346 transitions. Word has length 32 [2020-12-01 15:23:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:33,925 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1346 transitions. [2020-12-01 15:23:33,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:23:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1346 transitions. [2020-12-01 15:23:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 15:23:33,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:33,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:33,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:23:33,929 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash 917082783, now seen corresponding path program 1 times [2020-12-01 15:23:33,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:33,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449888856] [2020-12-01 15:23:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:34,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:34,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:34,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:34,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449888856] [2020-12-01 15:23:34,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:34,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 15:23:34,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582600464] [2020-12-01 15:23:34,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:23:34,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:23:34,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:23:34,288 INFO L87 Difference]: Start difference. First operand 906 states and 1346 transitions. Second operand 9 states. [2020-12-01 15:23:34,645 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2020-12-01 15:23:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:38,455 INFO L93 Difference]: Finished difference Result 1044 states and 1579 transitions. [2020-12-01 15:23:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:23:38,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-12-01 15:23:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:38,463 INFO L225 Difference]: With dead ends: 1044 [2020-12-01 15:23:38,464 INFO L226 Difference]: Without dead ends: 1044 [2020-12-01 15:23:38,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:23:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2020-12-01 15:23:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 834. [2020-12-01 15:23:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2020-12-01 15:23:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1201 transitions. [2020-12-01 15:23:38,504 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1201 transitions. Word has length 33 [2020-12-01 15:23:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:38,505 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 1201 transitions. [2020-12-01 15:23:38,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:23:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1201 transitions. [2020-12-01 15:23:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 15:23:38,507 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:38,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:38,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:23:38,508 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:38,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:38,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1758982707, now seen corresponding path program 1 times [2020-12-01 15:23:38,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:38,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845762778] [2020-12-01 15:23:38,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:38,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:38,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:38,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:38,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845762778] [2020-12-01 15:23:38,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:38,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:23:38,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972946370] [2020-12-01 15:23:38,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:23:38,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:38,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:23:38,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:23:38,758 INFO L87 Difference]: Start difference. First operand 834 states and 1201 transitions. Second operand 7 states. [2020-12-01 15:23:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:42,370 INFO L93 Difference]: Finished difference Result 960 states and 1418 transitions. [2020-12-01 15:23:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:23:42,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-12-01 15:23:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:42,377 INFO L225 Difference]: With dead ends: 960 [2020-12-01 15:23:42,377 INFO L226 Difference]: Without dead ends: 960 [2020-12-01 15:23:42,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:23:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2020-12-01 15:23:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 833. [2020-12-01 15:23:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2020-12-01 15:23:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1198 transitions. [2020-12-01 15:23:42,408 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1198 transitions. Word has length 37 [2020-12-01 15:23:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:42,409 INFO L481 AbstractCegarLoop]: Abstraction has 833 states and 1198 transitions. [2020-12-01 15:23:42,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:23:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1198 transitions. [2020-12-01 15:23:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 15:23:42,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:42,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:42,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:23:42,412 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash -30011405, now seen corresponding path program 1 times [2020-12-01 15:23:42,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:42,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140350607] [2020-12-01 15:23:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:42,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:42,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:42,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:42,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140350607] [2020-12-01 15:23:42,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:42,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:23:42,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928237241] [2020-12-01 15:23:42,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:23:42,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:23:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:23:42,624 INFO L87 Difference]: Start difference. First operand 833 states and 1198 transitions. Second operand 7 states. [2020-12-01 15:23:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:46,053 INFO L93 Difference]: Finished difference Result 996 states and 1430 transitions. [2020-12-01 15:23:46,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:23:46,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-01 15:23:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:46,085 INFO L225 Difference]: With dead ends: 996 [2020-12-01 15:23:46,086 INFO L226 Difference]: Without dead ends: 996 [2020-12-01 15:23:46,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:23:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2020-12-01 15:23:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 735. [2020-12-01 15:23:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-12-01 15:23:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1027 transitions. [2020-12-01 15:23:46,114 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1027 transitions. Word has length 40 [2020-12-01 15:23:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:46,115 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 1027 transitions. [2020-12-01 15:23:46,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:23:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1027 transitions. [2020-12-01 15:23:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 15:23:46,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:46,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:46,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:23:46,119 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1086719665, now seen corresponding path program 1 times [2020-12-01 15:23:46,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:46,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325177970] [2020-12-01 15:23:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:46,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:46,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:46,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:46,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325177970] [2020-12-01 15:23:46,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:46,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:23:46,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934211264] [2020-12-01 15:23:46,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:23:46,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:23:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:23:46,386 INFO L87 Difference]: Start difference. First operand 735 states and 1027 transitions. Second operand 6 states. [2020-12-01 15:23:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:48,855 INFO L93 Difference]: Finished difference Result 959 states and 1379 transitions. [2020-12-01 15:23:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:23:48,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-12-01 15:23:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:48,860 INFO L225 Difference]: With dead ends: 959 [2020-12-01 15:23:48,861 INFO L226 Difference]: Without dead ends: 959 [2020-12-01 15:23:48,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:23:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-12-01 15:23:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 755. [2020-12-01 15:23:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2020-12-01 15:23:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1053 transitions. [2020-12-01 15:23:48,889 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1053 transitions. Word has length 41 [2020-12-01 15:23:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:48,889 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 1053 transitions. [2020-12-01 15:23:48,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:23:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1053 transitions. [2020-12-01 15:23:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-01 15:23:48,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:48,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:48,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:23:48,893 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1864528831, now seen corresponding path program 1 times [2020-12-01 15:23:48,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:48,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007966642] [2020-12-01 15:23:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:49,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:49,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:49,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:49,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-12-01 15:23:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:49,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007966642] [2020-12-01 15:23:49,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:49,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:23:49,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108784611] [2020-12-01 15:23:49,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:23:49,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:49,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:23:49,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:23:49,120 INFO L87 Difference]: Start difference. First operand 755 states and 1053 transitions. Second operand 7 states. [2020-12-01 15:23:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:52,314 INFO L93 Difference]: Finished difference Result 936 states and 1347 transitions. [2020-12-01 15:23:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:23:52,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2020-12-01 15:23:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:52,320 INFO L225 Difference]: With dead ends: 936 [2020-12-01 15:23:52,321 INFO L226 Difference]: Without dead ends: 936 [2020-12-01 15:23:52,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:23:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2020-12-01 15:23:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 755. [2020-12-01 15:23:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2020-12-01 15:23:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1052 transitions. [2020-12-01 15:23:52,346 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1052 transitions. Word has length 47 [2020-12-01 15:23:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:52,347 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 1052 transitions. [2020-12-01 15:23:52,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:23:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1052 transitions. [2020-12-01 15:23:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:23:52,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:52,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:52,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:23:52,350 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2012285761, now seen corresponding path program 1 times [2020-12-01 15:23:52,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:52,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768715215] [2020-12-01 15:23:52,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:52,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:52,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:52,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:52,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-01 15:23:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:52,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768715215] [2020-12-01 15:23:52,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:52,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:23:52,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587213796] [2020-12-01 15:23:52,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:23:52,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:23:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:23:52,577 INFO L87 Difference]: Start difference. First operand 755 states and 1052 transitions. Second operand 7 states. [2020-12-01 15:23:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:53,992 INFO L93 Difference]: Finished difference Result 891 states and 1289 transitions. [2020-12-01 15:23:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:23:53,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-12-01 15:23:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:53,997 INFO L225 Difference]: With dead ends: 891 [2020-12-01 15:23:53,997 INFO L226 Difference]: Without dead ends: 891 [2020-12-01 15:23:53,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:23:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2020-12-01 15:23:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 744. [2020-12-01 15:23:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-12-01 15:23:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1039 transitions. [2020-12-01 15:23:54,023 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1039 transitions. Word has length 48 [2020-12-01 15:23:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:54,023 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1039 transitions. [2020-12-01 15:23:54,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:23:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1039 transitions. [2020-12-01 15:23:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-01 15:23:54,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:54,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:54,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:23:54,027 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 690393457, now seen corresponding path program 1 times [2020-12-01 15:23:54,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:54,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208353197] [2020-12-01 15:23:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:54,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:54,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:54,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:54,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:23:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:54,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:23:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:54,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208353197] [2020-12-01 15:23:54,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:54,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 15:23:54,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736615840] [2020-12-01 15:23:54,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 15:23:54,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 15:23:54,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:23:54,327 INFO L87 Difference]: Start difference. First operand 744 states and 1039 transitions. Second operand 11 states. [2020-12-01 15:23:54,958 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2020-12-01 15:23:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:23:57,734 INFO L93 Difference]: Finished difference Result 999 states and 1428 transitions. [2020-12-01 15:23:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:23:57,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-12-01 15:23:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:23:57,739 INFO L225 Difference]: With dead ends: 999 [2020-12-01 15:23:57,739 INFO L226 Difference]: Without dead ends: 999 [2020-12-01 15:23:57,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-12-01 15:23:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2020-12-01 15:23:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 787. [2020-12-01 15:23:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-12-01 15:23:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1100 transitions. [2020-12-01 15:23:57,767 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1100 transitions. Word has length 49 [2020-12-01 15:23:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:23:57,767 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1100 transitions. [2020-12-01 15:23:57,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 15:23:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1100 transitions. [2020-12-01 15:23:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-01 15:23:57,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:23:57,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:23:57,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:23:57,771 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:23:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:23:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -733105034, now seen corresponding path program 1 times [2020-12-01 15:23:57,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:23:57,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971001797] [2020-12-01 15:23:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:23:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:57,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:23:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:57,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:23:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:57,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:23:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:57,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:23:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:57,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:23:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:23:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:23:58,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971001797] [2020-12-01 15:23:58,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:23:58,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:23:58,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97036943] [2020-12-01 15:23:58,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:23:58,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:23:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:23:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:23:58,013 INFO L87 Difference]: Start difference. First operand 787 states and 1100 transitions. Second operand 7 states. [2020-12-01 15:24:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:01,217 INFO L93 Difference]: Finished difference Result 1085 states and 1551 transitions. [2020-12-01 15:24:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:24:01,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2020-12-01 15:24:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:01,222 INFO L225 Difference]: With dead ends: 1085 [2020-12-01 15:24:01,223 INFO L226 Difference]: Without dead ends: 1085 [2020-12-01 15:24:01,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:24:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2020-12-01 15:24:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 861. [2020-12-01 15:24:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2020-12-01 15:24:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1185 transitions. [2020-12-01 15:24:01,252 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1185 transitions. Word has length 51 [2020-12-01 15:24:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:01,252 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 1185 transitions. [2020-12-01 15:24:01,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:24:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1185 transitions. [2020-12-01 15:24:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-01 15:24:01,255 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:01,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:01,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:24:01,256 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash 703329142, now seen corresponding path program 1 times [2020-12-01 15:24:01,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:01,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118869783] [2020-12-01 15:24:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:01,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:01,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:01,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:01,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:24:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:01,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:01,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118869783] [2020-12-01 15:24:01,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:01,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 15:24:01,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147648746] [2020-12-01 15:24:01,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:24:01,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:24:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:24:01,501 INFO L87 Difference]: Start difference. First operand 861 states and 1185 transitions. Second operand 8 states. [2020-12-01 15:24:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:04,621 INFO L93 Difference]: Finished difference Result 991 states and 1411 transitions. [2020-12-01 15:24:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:24:04,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-12-01 15:24:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:04,626 INFO L225 Difference]: With dead ends: 991 [2020-12-01 15:24:04,626 INFO L226 Difference]: Without dead ends: 991 [2020-12-01 15:24:04,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:24:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2020-12-01 15:24:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 864. [2020-12-01 15:24:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2020-12-01 15:24:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2020-12-01 15:24:04,655 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 51 [2020-12-01 15:24:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:04,655 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2020-12-01 15:24:04,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:24:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2020-12-01 15:24:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-01 15:24:04,658 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:04,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:04,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:24:04,659 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -985614600, now seen corresponding path program 1 times [2020-12-01 15:24:04,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:04,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929283272] [2020-12-01 15:24:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:04,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:04,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:04,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:04,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:24:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:04,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:04,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929283272] [2020-12-01 15:24:04,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:04,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 15:24:04,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636143617] [2020-12-01 15:24:04,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 15:24:04,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:04,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 15:24:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:24:04,967 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 11 states. [2020-12-01 15:24:05,199 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 99 [2020-12-01 15:24:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:08,710 INFO L93 Difference]: Finished difference Result 960 states and 1366 transitions. [2020-12-01 15:24:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:24:08,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2020-12-01 15:24:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:08,714 INFO L225 Difference]: With dead ends: 960 [2020-12-01 15:24:08,714 INFO L226 Difference]: Without dead ends: 960 [2020-12-01 15:24:08,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:24:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2020-12-01 15:24:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 838. [2020-12-01 15:24:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-01 15:24:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1151 transitions. [2020-12-01 15:24:08,739 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1151 transitions. Word has length 51 [2020-12-01 15:24:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:08,739 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1151 transitions. [2020-12-01 15:24:08,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 15:24:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1151 transitions. [2020-12-01 15:24:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:24:08,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:08,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:08,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:24:08,743 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1671121095, now seen corresponding path program 1 times [2020-12-01 15:24:08,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:08,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931110932] [2020-12-01 15:24:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:08,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:08,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:08,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:09,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931110932] [2020-12-01 15:24:09,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:09,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 15:24:09,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039009839] [2020-12-01 15:24:09,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:24:09,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:24:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:24:09,079 INFO L87 Difference]: Start difference. First operand 838 states and 1151 transitions. Second operand 9 states. [2020-12-01 15:24:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:12,060 INFO L93 Difference]: Finished difference Result 979 states and 1387 transitions. [2020-12-01 15:24:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:24:12,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-12-01 15:24:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:12,063 INFO L225 Difference]: With dead ends: 979 [2020-12-01 15:24:12,063 INFO L226 Difference]: Without dead ends: 979 [2020-12-01 15:24:12,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:24:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-12-01 15:24:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 856. [2020-12-01 15:24:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2020-12-01 15:24:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1172 transitions. [2020-12-01 15:24:12,088 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1172 transitions. Word has length 53 [2020-12-01 15:24:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:12,088 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1172 transitions. [2020-12-01 15:24:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:24:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1172 transitions. [2020-12-01 15:24:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-01 15:24:12,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:12,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:12,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:24:12,092 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:12,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1102048598, now seen corresponding path program 1 times [2020-12-01 15:24:12,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:12,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840205748] [2020-12-01 15:24:12,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:24:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-12-01 15:24:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:12,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840205748] [2020-12-01 15:24:12,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:12,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 15:24:12,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123195563] [2020-12-01 15:24:12,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:24:12,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:12,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:24:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:24:12,320 INFO L87 Difference]: Start difference. First operand 856 states and 1172 transitions. Second operand 8 states. [2020-12-01 15:24:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:14,497 INFO L93 Difference]: Finished difference Result 948 states and 1348 transitions. [2020-12-01 15:24:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:24:14,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2020-12-01 15:24:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:14,501 INFO L225 Difference]: With dead ends: 948 [2020-12-01 15:24:14,501 INFO L226 Difference]: Without dead ends: 948 [2020-12-01 15:24:14,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:24:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-12-01 15:24:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 828. [2020-12-01 15:24:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2020-12-01 15:24:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1135 transitions. [2020-12-01 15:24:14,523 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1135 transitions. Word has length 55 [2020-12-01 15:24:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:14,524 INFO L481 AbstractCegarLoop]: Abstraction has 828 states and 1135 transitions. [2020-12-01 15:24:14,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:24:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1135 transitions. [2020-12-01 15:24:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-01 15:24:14,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:14,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:14,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:24:14,528 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -377174853, now seen corresponding path program 1 times [2020-12-01 15:24:14,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:14,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987347133] [2020-12-01 15:24:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:24:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:14,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987347133] [2020-12-01 15:24:14,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:14,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:24:14,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710603857] [2020-12-01 15:24:14,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:24:14,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:24:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:24:14,816 INFO L87 Difference]: Start difference. First operand 828 states and 1135 transitions. Second operand 12 states. [2020-12-01 15:24:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:18,718 INFO L93 Difference]: Finished difference Result 960 states and 1362 transitions. [2020-12-01 15:24:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:24:18,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-12-01 15:24:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:18,722 INFO L225 Difference]: With dead ends: 960 [2020-12-01 15:24:18,723 INFO L226 Difference]: Without dead ends: 959 [2020-12-01 15:24:18,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:24:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-12-01 15:24:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 835. [2020-12-01 15:24:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-12-01 15:24:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1144 transitions. [2020-12-01 15:24:18,745 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1144 transitions. Word has length 52 [2020-12-01 15:24:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:18,746 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 1144 transitions. [2020-12-01 15:24:18,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:24:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1144 transitions. [2020-12-01 15:24:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-01 15:24:18,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:18,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:18,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:24:18,749 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash -385756583, now seen corresponding path program 1 times [2020-12-01 15:24:18,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:18,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646040069] [2020-12-01 15:24:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:18,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:18,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:18,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:18,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:24:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:19,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:19,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646040069] [2020-12-01 15:24:19,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:19,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:24:19,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003692555] [2020-12-01 15:24:19,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:24:19,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:19,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:24:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:24:19,065 INFO L87 Difference]: Start difference. First operand 835 states and 1144 transitions. Second operand 12 states. [2020-12-01 15:24:19,998 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-12-01 15:24:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:23,097 INFO L93 Difference]: Finished difference Result 975 states and 1378 transitions. [2020-12-01 15:24:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:24:23,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-12-01 15:24:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:23,107 INFO L225 Difference]: With dead ends: 975 [2020-12-01 15:24:23,107 INFO L226 Difference]: Without dead ends: 954 [2020-12-01 15:24:23,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:24:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2020-12-01 15:24:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 834. [2020-12-01 15:24:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2020-12-01 15:24:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1142 transitions. [2020-12-01 15:24:23,146 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1142 transitions. Word has length 52 [2020-12-01 15:24:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:23,147 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 1142 transitions. [2020-12-01 15:24:23,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:24:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1142 transitions. [2020-12-01 15:24:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-01 15:24:23,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:23,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:23,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:24:23,151 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1130809384, now seen corresponding path program 1 times [2020-12-01 15:24:23,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:23,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004979736] [2020-12-01 15:24:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:23,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004979736] [2020-12-01 15:24:23,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:23,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:24:23,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588506352] [2020-12-01 15:24:23,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:24:23,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:24:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:24:23,648 INFO L87 Difference]: Start difference. First operand 834 states and 1142 transitions. Second operand 13 states. [2020-12-01 15:24:23,778 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-01 15:24:23,914 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-12-01 15:24:25,540 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2020-12-01 15:24:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:26,869 INFO L93 Difference]: Finished difference Result 959 states and 1358 transitions. [2020-12-01 15:24:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:24:26,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2020-12-01 15:24:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:26,873 INFO L225 Difference]: With dead ends: 959 [2020-12-01 15:24:26,873 INFO L226 Difference]: Without dead ends: 959 [2020-12-01 15:24:26,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:24:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-12-01 15:24:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 834. [2020-12-01 15:24:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2020-12-01 15:24:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1141 transitions. [2020-12-01 15:24:26,897 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1141 transitions. Word has length 54 [2020-12-01 15:24:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:26,898 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 1141 transitions. [2020-12-01 15:24:26,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:24:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1141 transitions. [2020-12-01 15:24:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:24:26,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:26,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:26,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:24:26,902 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1398678129, now seen corresponding path program 1 times [2020-12-01 15:24:26,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:26,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746076233] [2020-12-01 15:24:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:27,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:27,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:27,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:27,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:24:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:27,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:27,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746076233] [2020-12-01 15:24:27,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:27,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 15:24:27,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721321356] [2020-12-01 15:24:27,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:24:27,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:27,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:24:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:24:27,209 INFO L87 Difference]: Start difference. First operand 834 states and 1141 transitions. Second operand 9 states. [2020-12-01 15:24:28,960 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2020-12-01 15:24:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:31,226 INFO L93 Difference]: Finished difference Result 966 states and 1363 transitions. [2020-12-01 15:24:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:24:31,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-12-01 15:24:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:31,230 INFO L225 Difference]: With dead ends: 966 [2020-12-01 15:24:31,230 INFO L226 Difference]: Without dead ends: 934 [2020-12-01 15:24:31,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2020-12-01 15:24:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2020-12-01 15:24:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 806. [2020-12-01 15:24:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-12-01 15:24:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1109 transitions. [2020-12-01 15:24:31,256 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1109 transitions. Word has length 53 [2020-12-01 15:24:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:31,256 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1109 transitions. [2020-12-01 15:24:31,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:24:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1109 transitions. [2020-12-01 15:24:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-01 15:24:31,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:31,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:31,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:24:31,260 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:31,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1718107870, now seen corresponding path program 1 times [2020-12-01 15:24:31,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:31,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990650127] [2020-12-01 15:24:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:31,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990650127] [2020-12-01 15:24:31,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:31,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:24:31,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519414347] [2020-12-01 15:24:31,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:24:31,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:31,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:24:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:24:31,693 INFO L87 Difference]: Start difference. First operand 806 states and 1109 transitions. Second operand 13 states. [2020-12-01 15:24:33,544 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2020-12-01 15:24:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:34,935 INFO L93 Difference]: Finished difference Result 929 states and 1323 transitions. [2020-12-01 15:24:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:24:34,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-12-01 15:24:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:34,940 INFO L225 Difference]: With dead ends: 929 [2020-12-01 15:24:34,940 INFO L226 Difference]: Without dead ends: 929 [2020-12-01 15:24:34,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:24:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-12-01 15:24:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 806. [2020-12-01 15:24:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-12-01 15:24:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1108 transitions. [2020-12-01 15:24:34,967 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1108 transitions. Word has length 55 [2020-12-01 15:24:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:34,967 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1108 transitions. [2020-12-01 15:24:34,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:24:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1108 transitions. [2020-12-01 15:24:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-01 15:24:34,970 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:34,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:34,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 15:24:34,971 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:34,972 INFO L82 PathProgramCache]: Analyzing trace with hash -635813153, now seen corresponding path program 1 times [2020-12-01 15:24:34,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:34,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913772654] [2020-12-01 15:24:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,139 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:24:35,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:35,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913772654] [2020-12-01 15:24:35,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:35,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-01 15:24:35,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994789390] [2020-12-01 15:24:35,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:24:35,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:24:35,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:24:35,393 INFO L87 Difference]: Start difference. First operand 806 states and 1108 transitions. Second operand 15 states. [2020-12-01 15:24:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:38,486 INFO L93 Difference]: Finished difference Result 954 states and 1354 transitions. [2020-12-01 15:24:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:24:38,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-12-01 15:24:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:38,492 INFO L225 Difference]: With dead ends: 954 [2020-12-01 15:24:38,492 INFO L226 Difference]: Without dead ends: 917 [2020-12-01 15:24:38,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:24:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2020-12-01 15:24:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 797. [2020-12-01 15:24:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-12-01 15:24:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1084 transitions. [2020-12-01 15:24:38,516 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1084 transitions. Word has length 56 [2020-12-01 15:24:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:38,517 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1084 transitions. [2020-12-01 15:24:38,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:24:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1084 transitions. [2020-12-01 15:24:38,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-01 15:24:38,520 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:38,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:38,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 15:24:38,521 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:38,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash 546784122, now seen corresponding path program 1 times [2020-12-01 15:24:38,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:38,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512617198] [2020-12-01 15:24:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,679 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:24:38,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:24:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:38,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512617198] [2020-12-01 15:24:38,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:38,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-01 15:24:38,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651927921] [2020-12-01 15:24:38,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:24:38,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:24:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:24:38,982 INFO L87 Difference]: Start difference. First operand 797 states and 1084 transitions. Second operand 15 states. [2020-12-01 15:24:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:42,378 INFO L93 Difference]: Finished difference Result 930 states and 1308 transitions. [2020-12-01 15:24:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:24:42,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-12-01 15:24:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:42,384 INFO L225 Difference]: With dead ends: 930 [2020-12-01 15:24:42,384 INFO L226 Difference]: Without dead ends: 915 [2020-12-01 15:24:42,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:24:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2020-12-01 15:24:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 795. [2020-12-01 15:24:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-12-01 15:24:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1080 transitions. [2020-12-01 15:24:42,409 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1080 transitions. Word has length 56 [2020-12-01 15:24:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:42,410 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 1080 transitions. [2020-12-01 15:24:42,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:24:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1080 transitions. [2020-12-01 15:24:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-01 15:24:42,413 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:42,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:42,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 15:24:42,414 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -623448346, now seen corresponding path program 1 times [2020-12-01 15:24:42,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:42,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361091773] [2020-12-01 15:24:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:24:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:24:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:42,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361091773] [2020-12-01 15:24:42,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:42,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 15:24:42,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778203951] [2020-12-01 15:24:42,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 15:24:42,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 15:24:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:24:42,769 INFO L87 Difference]: Start difference. First operand 795 states and 1080 transitions. Second operand 10 states. [2020-12-01 15:24:42,898 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-01 15:24:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:45,135 INFO L93 Difference]: Finished difference Result 938 states and 1312 transitions. [2020-12-01 15:24:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:24:45,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-12-01 15:24:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:45,139 INFO L225 Difference]: With dead ends: 938 [2020-12-01 15:24:45,140 INFO L226 Difference]: Without dead ends: 938 [2020-12-01 15:24:45,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:24:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2020-12-01 15:24:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 795. [2020-12-01 15:24:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-12-01 15:24:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1079 transitions. [2020-12-01 15:24:45,162 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1079 transitions. Word has length 57 [2020-12-01 15:24:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:45,163 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 1079 transitions. [2020-12-01 15:24:45,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 15:24:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1079 transitions. [2020-12-01 15:24:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-01 15:24:45,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:45,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:45,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 15:24:45,167 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash 408956398, now seen corresponding path program 1 times [2020-12-01 15:24:45,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:45,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523940527] [2020-12-01 15:24:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:24:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:24:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:45,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523940527] [2020-12-01 15:24:45,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:45,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-01 15:24:45,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101004386] [2020-12-01 15:24:45,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:24:45,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:24:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:24:45,545 INFO L87 Difference]: Start difference. First operand 795 states and 1079 transitions. Second operand 15 states. [2020-12-01 15:24:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:48,990 INFO L93 Difference]: Finished difference Result 925 states and 1300 transitions. [2020-12-01 15:24:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:24:48,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-12-01 15:24:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:48,996 INFO L225 Difference]: With dead ends: 925 [2020-12-01 15:24:48,996 INFO L226 Difference]: Without dead ends: 910 [2020-12-01 15:24:48,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:24:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2020-12-01 15:24:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 790. [2020-12-01 15:24:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-12-01 15:24:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1072 transitions. [2020-12-01 15:24:49,021 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1072 transitions. Word has length 57 [2020-12-01 15:24:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:49,021 INFO L481 AbstractCegarLoop]: Abstraction has 790 states and 1072 transitions. [2020-12-01 15:24:49,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:24:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1072 transitions. [2020-12-01 15:24:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-01 15:24:49,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:49,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:49,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-01 15:24:49,025 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1935820183, now seen corresponding path program 1 times [2020-12-01 15:24:49,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:49,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568047308] [2020-12-01 15:24:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-12-01 15:24:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:24:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:24:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:49,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568047308] [2020-12-01 15:24:49,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:49,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 15:24:49,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057817574] [2020-12-01 15:24:49,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:24:49,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:49,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:24:49,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:24:49,309 INFO L87 Difference]: Start difference. First operand 790 states and 1072 transitions. Second operand 8 states. [2020-12-01 15:24:50,584 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-01 15:24:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:52,521 INFO L93 Difference]: Finished difference Result 1015 states and 1407 transitions. [2020-12-01 15:24:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:24:52,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-12-01 15:24:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:52,526 INFO L225 Difference]: With dead ends: 1015 [2020-12-01 15:24:52,527 INFO L226 Difference]: Without dead ends: 1015 [2020-12-01 15:24:52,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:24:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2020-12-01 15:24:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 831. [2020-12-01 15:24:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2020-12-01 15:24:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1112 transitions. [2020-12-01 15:24:52,551 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1112 transitions. Word has length 62 [2020-12-01 15:24:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:52,552 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 1112 transitions. [2020-12-01 15:24:52,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:24:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1112 transitions. [2020-12-01 15:24:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-01 15:24:52,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:52,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:52,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-01 15:24:52,556 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 803997428, now seen corresponding path program 1 times [2020-12-01 15:24:52,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:52,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854184332] [2020-12-01 15:24:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:52,714 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:24:52,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:52,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:52,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:52,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:52,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:24:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:53,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-01 15:24:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:53,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:53,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854184332] [2020-12-01 15:24:53,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:53,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-01 15:24:53,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279131593] [2020-12-01 15:24:53,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:24:53,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:53,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:24:53,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:24:53,191 INFO L87 Difference]: Start difference. First operand 831 states and 1112 transitions. Second operand 20 states. [2020-12-01 15:24:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:57,367 INFO L93 Difference]: Finished difference Result 996 states and 1381 transitions. [2020-12-01 15:24:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-01 15:24:57,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2020-12-01 15:24:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:57,372 INFO L225 Difference]: With dead ends: 996 [2020-12-01 15:24:57,372 INFO L226 Difference]: Without dead ends: 975 [2020-12-01 15:24:57,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2020-12-01 15:24:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2020-12-01 15:24:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 829. [2020-12-01 15:24:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2020-12-01 15:24:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1108 transitions. [2020-12-01 15:24:57,398 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1108 transitions. Word has length 63 [2020-12-01 15:24:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:57,398 INFO L481 AbstractCegarLoop]: Abstraction has 829 states and 1108 transitions. [2020-12-01 15:24:57,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:24:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1108 transitions. [2020-12-01 15:24:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-01 15:24:57,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:57,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:57,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-01 15:24:57,402 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:24:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:57,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1598696486, now seen corresponding path program 1 times [2020-12-01 15:24:57,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:57,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952673112] [2020-12-01 15:24:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:24:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:24:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:24:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:24:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:24:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:24:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:24:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:57,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952673112] [2020-12-01 15:24:57,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:57,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-01 15:24:57,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592926874] [2020-12-01 15:24:57,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:24:57,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:24:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:24:57,995 INFO L87 Difference]: Start difference. First operand 829 states and 1108 transitions. Second operand 20 states. [2020-12-01 15:24:58,461 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:25:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:03,248 INFO L93 Difference]: Finished difference Result 994 states and 1377 transitions. [2020-12-01 15:25:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-01 15:25:03,249 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2020-12-01 15:25:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:03,251 INFO L225 Difference]: With dead ends: 994 [2020-12-01 15:25:03,251 INFO L226 Difference]: Without dead ends: 971 [2020-12-01 15:25:03,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2020-12-01 15:25:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2020-12-01 15:25:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 828. [2020-12-01 15:25:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2020-12-01 15:25:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1097 transitions. [2020-12-01 15:25:03,272 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1097 transitions. Word has length 60 [2020-12-01 15:25:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:03,272 INFO L481 AbstractCegarLoop]: Abstraction has 828 states and 1097 transitions. [2020-12-01 15:25:03,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:25:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1097 transitions. [2020-12-01 15:25:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-01 15:25:03,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:03,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:03,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-01 15:25:03,276 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -256692213, now seen corresponding path program 1 times [2020-12-01 15:25:03,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:03,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326490527] [2020-12-01 15:25:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:03,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326490527] [2020-12-01 15:25:03,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:03,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-01 15:25:03,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057783378] [2020-12-01 15:25:03,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:25:03,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:25:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:25:03,658 INFO L87 Difference]: Start difference. First operand 828 states and 1097 transitions. Second operand 16 states. [2020-12-01 15:25:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:07,074 INFO L93 Difference]: Finished difference Result 983 states and 1351 transitions. [2020-12-01 15:25:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-01 15:25:07,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2020-12-01 15:25:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:07,076 INFO L225 Difference]: With dead ends: 983 [2020-12-01 15:25:07,077 INFO L226 Difference]: Without dead ends: 966 [2020-12-01 15:25:07,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:25:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2020-12-01 15:25:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 825. [2020-12-01 15:25:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2020-12-01 15:25:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1092 transitions. [2020-12-01 15:25:07,096 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1092 transitions. Word has length 59 [2020-12-01 15:25:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:07,097 INFO L481 AbstractCegarLoop]: Abstraction has 825 states and 1092 transitions. [2020-12-01 15:25:07,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:25:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1092 transitions. [2020-12-01 15:25:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-01 15:25:07,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:07,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:07,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-01 15:25:07,101 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:07,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1439965499, now seen corresponding path program 1 times [2020-12-01 15:25:07,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:07,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514365075] [2020-12-01 15:25:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-01 15:25:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:07,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514365075] [2020-12-01 15:25:07,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:07,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-01 15:25:07,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318665212] [2020-12-01 15:25:07,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:25:07,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:25:07,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:25:07,551 INFO L87 Difference]: Start difference. First operand 825 states and 1092 transitions. Second operand 16 states. [2020-12-01 15:25:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:11,568 INFO L93 Difference]: Finished difference Result 987 states and 1352 transitions. [2020-12-01 15:25:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-01 15:25:11,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2020-12-01 15:25:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:11,571 INFO L225 Difference]: With dead ends: 987 [2020-12-01 15:25:11,571 INFO L226 Difference]: Without dead ends: 951 [2020-12-01 15:25:11,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2020-12-01 15:25:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2020-12-01 15:25:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 813. [2020-12-01 15:25:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2020-12-01 15:25:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1071 transitions. [2020-12-01 15:25:11,588 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1071 transitions. Word has length 60 [2020-12-01 15:25:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:11,588 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1071 transitions. [2020-12-01 15:25:11,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:25:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1071 transitions. [2020-12-01 15:25:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-01 15:25:11,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:11,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:11,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-01 15:25:11,592 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1498078657, now seen corresponding path program 1 times [2020-12-01 15:25:11,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:11,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799415376] [2020-12-01 15:25:11,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:25:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-01 15:25:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:11,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799415376] [2020-12-01 15:25:11,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:11,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 15:25:11,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041800639] [2020-12-01 15:25:11,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 15:25:11,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 15:25:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:25:11,949 INFO L87 Difference]: Start difference. First operand 813 states and 1071 transitions. Second operand 11 states. [2020-12-01 15:25:12,412 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-01 15:25:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:14,486 INFO L93 Difference]: Finished difference Result 1012 states and 1409 transitions. [2020-12-01 15:25:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:25:14,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-12-01 15:25:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:14,488 INFO L225 Difference]: With dead ends: 1012 [2020-12-01 15:25:14,488 INFO L226 Difference]: Without dead ends: 1012 [2020-12-01 15:25:14,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:25:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2020-12-01 15:25:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 820. [2020-12-01 15:25:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-12-01 15:25:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1086 transitions. [2020-12-01 15:25:14,507 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1086 transitions. Word has length 61 [2020-12-01 15:25:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:14,507 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1086 transitions. [2020-12-01 15:25:14,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 15:25:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1086 transitions. [2020-12-01 15:25:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-01 15:25:14,510 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:14,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:14,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-01 15:25:14,511 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1570465215, now seen corresponding path program 1 times [2020-12-01 15:25:14,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:14,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746384997] [2020-12-01 15:25:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:25:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-01 15:25:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:14,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746384997] [2020-12-01 15:25:14,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:14,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-01 15:25:14,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585639761] [2020-12-01 15:25:14,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:25:14,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:25:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:25:14,903 INFO L87 Difference]: Start difference. First operand 820 states and 1086 transitions. Second operand 16 states. [2020-12-01 15:25:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:19,016 INFO L93 Difference]: Finished difference Result 981 states and 1355 transitions. [2020-12-01 15:25:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:25:19,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2020-12-01 15:25:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:19,019 INFO L225 Difference]: With dead ends: 981 [2020-12-01 15:25:19,020 INFO L226 Difference]: Without dead ends: 959 [2020-12-01 15:25:19,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:25:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-12-01 15:25:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 818. [2020-12-01 15:25:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2020-12-01 15:25:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1082 transitions. [2020-12-01 15:25:19,040 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1082 transitions. Word has length 61 [2020-12-01 15:25:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:19,040 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1082 transitions. [2020-12-01 15:25:19,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:25:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1082 transitions. [2020-12-01 15:25:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-01 15:25:19,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:19,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:19,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-01 15:25:19,045 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:19,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1923171520, now seen corresponding path program 1 times [2020-12-01 15:25:19,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:19,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667707593] [2020-12-01 15:25:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,209 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:25:19,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:25:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:19,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667707593] [2020-12-01 15:25:19,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:19,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 15:25:19,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454665169] [2020-12-01 15:25:19,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 15:25:19,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 15:25:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:25:19,446 INFO L87 Difference]: Start difference. First operand 818 states and 1082 transitions. Second operand 11 states. [2020-12-01 15:25:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:22,629 INFO L93 Difference]: Finished difference Result 961 states and 1329 transitions. [2020-12-01 15:25:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:25:22,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-12-01 15:25:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:22,633 INFO L225 Difference]: With dead ends: 961 [2020-12-01 15:25:22,633 INFO L226 Difference]: Without dead ends: 961 [2020-12-01 15:25:22,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:25:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-12-01 15:25:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 818. [2020-12-01 15:25:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2020-12-01 15:25:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1081 transitions. [2020-12-01 15:25:22,651 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1081 transitions. Word has length 61 [2020-12-01 15:25:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:22,652 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1081 transitions. [2020-12-01 15:25:22,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 15:25:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1081 transitions. [2020-12-01 15:25:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-01 15:25:22,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:22,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:22,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-01 15:25:22,655 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash -536968126, now seen corresponding path program 1 times [2020-12-01 15:25:22,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:22,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781961856] [2020-12-01 15:25:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:22,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:22,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:22,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:22,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:22,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:23,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:25:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:23,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781961856] [2020-12-01 15:25:23,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:23,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-01 15:25:23,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872201196] [2020-12-01 15:25:23,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:25:23,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:25:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:25:23,066 INFO L87 Difference]: Start difference. First operand 818 states and 1081 transitions. Second operand 15 states. [2020-12-01 15:25:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:26,114 INFO L93 Difference]: Finished difference Result 995 states and 1374 transitions. [2020-12-01 15:25:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:25:26,114 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-12-01 15:25:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:26,117 INFO L225 Difference]: With dead ends: 995 [2020-12-01 15:25:26,117 INFO L226 Difference]: Without dead ends: 948 [2020-12-01 15:25:26,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:25:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-12-01 15:25:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 810. [2020-12-01 15:25:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-12-01 15:25:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1066 transitions. [2020-12-01 15:25:26,140 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1066 transitions. Word has length 61 [2020-12-01 15:25:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:26,140 INFO L481 AbstractCegarLoop]: Abstraction has 810 states and 1066 transitions. [2020-12-01 15:25:26,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:25:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1066 transitions. [2020-12-01 15:25:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-01 15:25:26,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:26,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:26,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-01 15:25:26,147 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1829436509, now seen corresponding path program 1 times [2020-12-01 15:25:26,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:26,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299959284] [2020-12-01 15:25:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,304 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:25:26,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:25:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:25:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:26,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299959284] [2020-12-01 15:25:26,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:26,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:25:26,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245181885] [2020-12-01 15:25:26,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:25:26,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:26,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:25:26,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:25:26,538 INFO L87 Difference]: Start difference. First operand 810 states and 1066 transitions. Second operand 12 states. [2020-12-01 15:25:27,333 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:25:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:29,811 INFO L93 Difference]: Finished difference Result 964 states and 1347 transitions. [2020-12-01 15:25:29,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:25:29,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-12-01 15:25:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:29,815 INFO L225 Difference]: With dead ends: 964 [2020-12-01 15:25:29,815 INFO L226 Difference]: Without dead ends: 962 [2020-12-01 15:25:29,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:25:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-12-01 15:25:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 814. [2020-12-01 15:25:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-12-01 15:25:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1084 transitions. [2020-12-01 15:25:29,836 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1084 transitions. Word has length 62 [2020-12-01 15:25:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:29,837 INFO L481 AbstractCegarLoop]: Abstraction has 814 states and 1084 transitions. [2020-12-01 15:25:29,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:25:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1084 transitions. [2020-12-01 15:25:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-01 15:25:29,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:29,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:29,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-01 15:25:29,841 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1317912023, now seen corresponding path program 1 times [2020-12-01 15:25:29,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:29,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85951039] [2020-12-01 15:25:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,020 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:25:30,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:25:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:30,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85951039] [2020-12-01 15:25:30,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:30,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-01 15:25:30,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025330037] [2020-12-01 15:25:30,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:25:30,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:25:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:25:30,443 INFO L87 Difference]: Start difference. First operand 814 states and 1084 transitions. Second operand 19 states. [2020-12-01 15:25:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:34,291 INFO L93 Difference]: Finished difference Result 966 states and 1342 transitions. [2020-12-01 15:25:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-01 15:25:34,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2020-12-01 15:25:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:34,294 INFO L225 Difference]: With dead ends: 966 [2020-12-01 15:25:34,294 INFO L226 Difference]: Without dead ends: 939 [2020-12-01 15:25:34,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:25:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-01 15:25:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 803. [2020-12-01 15:25:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-12-01 15:25:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1069 transitions. [2020-12-01 15:25:34,312 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1069 transitions. Word has length 70 [2020-12-01 15:25:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:34,312 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 1069 transitions. [2020-12-01 15:25:34,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:25:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1069 transitions. [2020-12-01 15:25:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-01 15:25:34,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:34,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:34,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-01 15:25:34,316 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 252900575, now seen corresponding path program 1 times [2020-12-01 15:25:34,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:34,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348249859] [2020-12-01 15:25:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:25:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:34,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348249859] [2020-12-01 15:25:34,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:34,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-01 15:25:34,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382010300] [2020-12-01 15:25:34,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:25:34,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:25:34,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:25:34,769 INFO L87 Difference]: Start difference. First operand 803 states and 1069 transitions. Second operand 19 states. [2020-12-01 15:25:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:39,097 INFO L93 Difference]: Finished difference Result 953 states and 1323 transitions. [2020-12-01 15:25:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-01 15:25:39,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2020-12-01 15:25:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:39,102 INFO L225 Difference]: With dead ends: 953 [2020-12-01 15:25:39,102 INFO L226 Difference]: Without dead ends: 934 [2020-12-01 15:25:39,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:25:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2020-12-01 15:25:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 798. [2020-12-01 15:25:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-12-01 15:25:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1062 transitions. [2020-12-01 15:25:39,124 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1062 transitions. Word has length 63 [2020-12-01 15:25:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:39,125 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1062 transitions. [2020-12-01 15:25:39,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:25:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1062 transitions. [2020-12-01 15:25:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-01 15:25:39,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:39,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:39,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-01 15:25:39,129 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1474404817, now seen corresponding path program 1 times [2020-12-01 15:25:39,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:39,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984278366] [2020-12-01 15:25:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:25:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:39,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984278366] [2020-12-01 15:25:39,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:39,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-01 15:25:39,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584908279] [2020-12-01 15:25:39,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-01 15:25:39,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-01 15:25:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:25:39,797 INFO L87 Difference]: Start difference. First operand 798 states and 1062 transitions. Second operand 21 states. [2020-12-01 15:25:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:44,126 INFO L93 Difference]: Finished difference Result 955 states and 1323 transitions. [2020-12-01 15:25:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:25:44,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2020-12-01 15:25:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:44,129 INFO L225 Difference]: With dead ends: 955 [2020-12-01 15:25:44,129 INFO L226 Difference]: Without dead ends: 933 [2020-12-01 15:25:44,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2020-12-01 15:25:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2020-12-01 15:25:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 796. [2020-12-01 15:25:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-12-01 15:25:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1058 transitions. [2020-12-01 15:25:44,171 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1058 transitions. Word has length 67 [2020-12-01 15:25:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:44,171 INFO L481 AbstractCegarLoop]: Abstraction has 796 states and 1058 transitions. [2020-12-01 15:25:44,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-01 15:25:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1058 transitions. [2020-12-01 15:25:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-01 15:25:44,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:44,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:44,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-01 15:25:44,175 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -300054206, now seen corresponding path program 1 times [2020-12-01 15:25:44,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:44,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459400670] [2020-12-01 15:25:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,338 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:25:44,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:25:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:44,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459400670] [2020-12-01 15:25:44,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:44,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-01 15:25:44,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339255145] [2020-12-01 15:25:44,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-01 15:25:44,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:44,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-01 15:25:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:25:44,776 INFO L87 Difference]: Start difference. First operand 796 states and 1058 transitions. Second operand 21 states. [2020-12-01 15:25:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:47,863 INFO L93 Difference]: Finished difference Result 952 states and 1316 transitions. [2020-12-01 15:25:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:25:47,864 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2020-12-01 15:25:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:47,866 INFO L225 Difference]: With dead ends: 952 [2020-12-01 15:25:47,866 INFO L226 Difference]: Without dead ends: 930 [2020-12-01 15:25:47,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2020-12-01 15:25:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-12-01 15:25:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 794. [2020-12-01 15:25:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-12-01 15:25:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1054 transitions. [2020-12-01 15:25:47,878 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1054 transitions. Word has length 68 [2020-12-01 15:25:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:47,878 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 1054 transitions. [2020-12-01 15:25:47,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-01 15:25:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1054 transitions. [2020-12-01 15:25:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-01 15:25:47,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:47,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:47,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-01 15:25:47,881 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1402347706, now seen corresponding path program 1 times [2020-12-01 15:25:47,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:47,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388021094] [2020-12-01 15:25:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-01 15:25:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:48,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388021094] [2020-12-01 15:25:48,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:48,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-01 15:25:48,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967013897] [2020-12-01 15:25:48,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:25:48,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:48,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:25:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:25:48,399 INFO L87 Difference]: Start difference. First operand 794 states and 1054 transitions. Second operand 20 states. [2020-12-01 15:25:49,251 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:25:49,652 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:25:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:52,365 INFO L93 Difference]: Finished difference Result 947 states and 1307 transitions. [2020-12-01 15:25:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-01 15:25:52,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2020-12-01 15:25:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:52,368 INFO L225 Difference]: With dead ends: 947 [2020-12-01 15:25:52,368 INFO L226 Difference]: Without dead ends: 926 [2020-12-01 15:25:52,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2020-12-01 15:25:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2020-12-01 15:25:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 792. [2020-12-01 15:25:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-12-01 15:25:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1050 transitions. [2020-12-01 15:25:52,383 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1050 transitions. Word has length 64 [2020-12-01 15:25:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:52,384 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 1050 transitions. [2020-12-01 15:25:52,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:25:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1050 transitions. [2020-12-01 15:25:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-01 15:25:52,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:52,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:52,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-01 15:25:52,388 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:52,389 INFO L82 PathProgramCache]: Analyzing trace with hash -237784410, now seen corresponding path program 1 times [2020-12-01 15:25:52,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:52,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256998213] [2020-12-01 15:25:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,535 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:25:52,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:25:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-01 15:25:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:52,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256998213] [2020-12-01 15:25:52,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:52,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 15:25:52,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283814859] [2020-12-01 15:25:52,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 15:25:52,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:52,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 15:25:52,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:25:52,744 INFO L87 Difference]: Start difference. First operand 792 states and 1050 transitions. Second operand 10 states. [2020-12-01 15:25:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:54,338 INFO L93 Difference]: Finished difference Result 791 states and 1043 transitions. [2020-12-01 15:25:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:25:54,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2020-12-01 15:25:54,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:54,341 INFO L225 Difference]: With dead ends: 791 [2020-12-01 15:25:54,341 INFO L226 Difference]: Without dead ends: 787 [2020-12-01 15:25:54,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:25:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2020-12-01 15:25:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 684. [2020-12-01 15:25:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-12-01 15:25:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 881 transitions. [2020-12-01 15:25:54,352 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 881 transitions. Word has length 64 [2020-12-01 15:25:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:54,352 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 881 transitions. [2020-12-01 15:25:54,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 15:25:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 881 transitions. [2020-12-01 15:25:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-01 15:25:54,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:54,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:54,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-01 15:25:54,356 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2132436373, now seen corresponding path program 1 times [2020-12-01 15:25:54,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:54,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467698704] [2020-12-01 15:25:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-01 15:25:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:54,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467698704] [2020-12-01 15:25:54,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:54,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-01 15:25:54,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661991429] [2020-12-01 15:25:54,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:25:54,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:25:54,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:25:54,882 INFO L87 Difference]: Start difference. First operand 684 states and 881 transitions. Second operand 19 states. [2020-12-01 15:25:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:58,253 INFO L93 Difference]: Finished difference Result 769 states and 1005 transitions. [2020-12-01 15:25:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-01 15:25:58,253 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2020-12-01 15:25:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:58,255 INFO L225 Difference]: With dead ends: 769 [2020-12-01 15:25:58,255 INFO L226 Difference]: Without dead ends: 750 [2020-12-01 15:25:58,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:25:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2020-12-01 15:25:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 682. [2020-12-01 15:25:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2020-12-01 15:25:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 877 transitions. [2020-12-01 15:25:58,264 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 877 transitions. Word has length 73 [2020-12-01 15:25:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:58,264 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 877 transitions. [2020-12-01 15:25:58,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:25:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 877 transitions. [2020-12-01 15:25:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-01 15:25:58,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:58,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:58,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-01 15:25:58,267 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:25:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:58,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1818365379, now seen corresponding path program 1 times [2020-12-01 15:25:58,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:58,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811076617] [2020-12-01 15:25:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:25:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:25:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:25:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:25:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:25:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:25:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:25:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:58,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811076617] [2020-12-01 15:25:58,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:58,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-01 15:25:58,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227154151] [2020-12-01 15:25:58,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:25:58,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:58,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:25:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:25:58,674 INFO L87 Difference]: Start difference. First operand 682 states and 877 transitions. Second operand 19 states. [2020-12-01 15:26:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:01,536 INFO L93 Difference]: Finished difference Result 764 states and 998 transitions. [2020-12-01 15:26:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-01 15:26:01,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2020-12-01 15:26:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:01,539 INFO L225 Difference]: With dead ends: 764 [2020-12-01 15:26:01,539 INFO L226 Difference]: Without dead ends: 745 [2020-12-01 15:26:01,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-12-01 15:26:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-12-01 15:26:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 677. [2020-12-01 15:26:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-12-01 15:26:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 870 transitions. [2020-12-01 15:26:01,555 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 870 transitions. Word has length 64 [2020-12-01 15:26:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:01,556 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 870 transitions. [2020-12-01 15:26:01,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:26:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 870 transitions. [2020-12-01 15:26:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-01 15:26:01,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:01,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:01,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-01 15:26:01,559 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1995677161, now seen corresponding path program 1 times [2020-12-01 15:26:01,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:01,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434763529] [2020-12-01 15:26:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-01 15:26:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:26:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:26:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:26:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:26:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:01,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434763529] [2020-12-01 15:26:01,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:01,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 15:26:01,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608404574] [2020-12-01 15:26:01,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:26:01,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:26:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:26:01,876 INFO L87 Difference]: Start difference. First operand 677 states and 870 transitions. Second operand 9 states. [2020-12-01 15:26:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:04,058 INFO L93 Difference]: Finished difference Result 745 states and 974 transitions. [2020-12-01 15:26:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:26:04,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-12-01 15:26:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:04,061 INFO L225 Difference]: With dead ends: 745 [2020-12-01 15:26:04,062 INFO L226 Difference]: Without dead ends: 745 [2020-12-01 15:26:04,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:26:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-12-01 15:26:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 677. [2020-12-01 15:26:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-12-01 15:26:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 868 transitions. [2020-12-01 15:26:04,077 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 868 transitions. Word has length 67 [2020-12-01 15:26:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:04,078 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 868 transitions. [2020-12-01 15:26:04,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:26:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 868 transitions. [2020-12-01 15:26:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-01 15:26:04,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:04,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:04,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-01 15:26:04,081 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:04,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1906254817, now seen corresponding path program 1 times [2020-12-01 15:26:04,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:04,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555394136] [2020-12-01 15:26:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,234 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:04,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:26:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:26:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:04,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555394136] [2020-12-01 15:26:04,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:04,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:26:04,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158784026] [2020-12-01 15:26:04,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:26:04,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:26:04,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:26:04,491 INFO L87 Difference]: Start difference. First operand 677 states and 868 transitions. Second operand 12 states. [2020-12-01 15:26:05,434 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-01 15:26:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:06,802 INFO L93 Difference]: Finished difference Result 769 states and 1006 transitions. [2020-12-01 15:26:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-01 15:26:06,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-12-01 15:26:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:06,806 INFO L225 Difference]: With dead ends: 769 [2020-12-01 15:26:06,806 INFO L226 Difference]: Without dead ends: 769 [2020-12-01 15:26:06,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:26:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2020-12-01 15:26:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 683. [2020-12-01 15:26:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2020-12-01 15:26:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 876 transitions. [2020-12-01 15:26:06,822 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 876 transitions. Word has length 66 [2020-12-01 15:26:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:06,823 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 876 transitions. [2020-12-01 15:26:06,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:26:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 876 transitions. [2020-12-01 15:26:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-01 15:26:06,825 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:06,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:06,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-01 15:26:06,826 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1763596529, now seen corresponding path program 1 times [2020-12-01 15:26:06,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:06,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286587568] [2020-12-01 15:26:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:06,978 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:06,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-01 15:26:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:07,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286587568] [2020-12-01 15:26:07,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:07,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:26:07,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932540797] [2020-12-01 15:26:07,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:26:07,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:26:07,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:26:07,188 INFO L87 Difference]: Start difference. First operand 683 states and 876 transitions. Second operand 12 states. [2020-12-01 15:26:07,961 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:26:08,134 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:26:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:09,552 INFO L93 Difference]: Finished difference Result 753 states and 982 transitions. [2020-12-01 15:26:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:26:09,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2020-12-01 15:26:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:09,563 INFO L225 Difference]: With dead ends: 753 [2020-12-01 15:26:09,563 INFO L226 Difference]: Without dead ends: 753 [2020-12-01 15:26:09,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:26:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-12-01 15:26:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 683. [2020-12-01 15:26:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2020-12-01 15:26:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 874 transitions. [2020-12-01 15:26:09,575 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 874 transitions. Word has length 67 [2020-12-01 15:26:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:09,576 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 874 transitions. [2020-12-01 15:26:09,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:26:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 874 transitions. [2020-12-01 15:26:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-01 15:26:09,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:09,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:09,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-01 15:26:09,579 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1488836915, now seen corresponding path program 1 times [2020-12-01 15:26:09,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:09,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634123831] [2020-12-01 15:26:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:09,744 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:09,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:09,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:09,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:09,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:09,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:10,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:10,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-01 15:26:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:10,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634123831] [2020-12-01 15:26:10,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:10,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-01 15:26:10,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671414589] [2020-12-01 15:26:10,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:26:10,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:26:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:26:10,048 INFO L87 Difference]: Start difference. First operand 683 states and 874 transitions. Second operand 16 states. [2020-12-01 15:26:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:12,941 INFO L93 Difference]: Finished difference Result 775 states and 1007 transitions. [2020-12-01 15:26:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-01 15:26:12,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2020-12-01 15:26:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:12,943 INFO L225 Difference]: With dead ends: 775 [2020-12-01 15:26:12,943 INFO L226 Difference]: Without dead ends: 701 [2020-12-01 15:26:12,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:26:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-12-01 15:26:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 646. [2020-12-01 15:26:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-12-01 15:26:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 813 transitions. [2020-12-01 15:26:12,954 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 813 transitions. Word has length 67 [2020-12-01 15:26:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:12,954 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 813 transitions. [2020-12-01 15:26:12,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:26:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 813 transitions. [2020-12-01 15:26:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-01 15:26:12,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:12,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:12,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-01 15:26:12,956 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 824055562, now seen corresponding path program 1 times [2020-12-01 15:26:12,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:12,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067089034] [2020-12-01 15:26:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,097 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:13,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-01 15:26:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:13,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067089034] [2020-12-01 15:26:13,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:13,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:26:13,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626006926] [2020-12-01 15:26:13,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:26:13,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:26:13,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:26:13,348 INFO L87 Difference]: Start difference. First operand 646 states and 813 transitions. Second operand 12 states. [2020-12-01 15:26:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:15,461 INFO L93 Difference]: Finished difference Result 695 states and 888 transitions. [2020-12-01 15:26:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:26:15,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2020-12-01 15:26:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:15,463 INFO L225 Difference]: With dead ends: 695 [2020-12-01 15:26:15,463 INFO L226 Difference]: Without dead ends: 690 [2020-12-01 15:26:15,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:26:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-12-01 15:26:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 641. [2020-12-01 15:26:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-12-01 15:26:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 806 transitions. [2020-12-01 15:26:15,476 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 806 transitions. Word has length 68 [2020-12-01 15:26:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:15,477 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 806 transitions. [2020-12-01 15:26:15,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:26:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 806 transitions. [2020-12-01 15:26:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-01 15:26:15,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:15,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:15,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-01 15:26:15,480 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2104573519, now seen corresponding path program 1 times [2020-12-01 15:26:15,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:15,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078694439] [2020-12-01 15:26:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:15,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078694439] [2020-12-01 15:26:15,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:15,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 15:26:15,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031631850] [2020-12-01 15:26:15,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 15:26:15,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 15:26:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:26:15,823 INFO L87 Difference]: Start difference. First operand 641 states and 806 transitions. Second operand 10 states. [2020-12-01 15:26:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:18,277 INFO L93 Difference]: Finished difference Result 807 states and 1028 transitions. [2020-12-01 15:26:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:26:18,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-12-01 15:26:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:18,281 INFO L225 Difference]: With dead ends: 807 [2020-12-01 15:26:18,281 INFO L226 Difference]: Without dead ends: 807 [2020-12-01 15:26:18,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:26:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-12-01 15:26:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 683. [2020-12-01 15:26:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2020-12-01 15:26:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 853 transitions. [2020-12-01 15:26:18,298 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 853 transitions. Word has length 68 [2020-12-01 15:26:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:18,299 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 853 transitions. [2020-12-01 15:26:18,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 15:26:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 853 transitions. [2020-12-01 15:26:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-01 15:26:18,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:18,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:18,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-01 15:26:18,302 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash 56975072, now seen corresponding path program 1 times [2020-12-01 15:26:18,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:18,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381831514] [2020-12-01 15:26:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,467 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:18,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:18,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381831514] [2020-12-01 15:26:18,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:18,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:26:18,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556567793] [2020-12-01 15:26:18,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:26:18,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:26:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:26:18,733 INFO L87 Difference]: Start difference. First operand 683 states and 853 transitions. Second operand 12 states. [2020-12-01 15:26:18,890 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-01 15:26:20,302 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 101 [2020-12-01 15:26:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:21,688 INFO L93 Difference]: Finished difference Result 805 states and 1025 transitions. [2020-12-01 15:26:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:26:21,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-12-01 15:26:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:21,690 INFO L225 Difference]: With dead ends: 805 [2020-12-01 15:26:21,691 INFO L226 Difference]: Without dead ends: 805 [2020-12-01 15:26:21,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:26:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-12-01 15:26:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 683. [2020-12-01 15:26:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2020-12-01 15:26:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 852 transitions. [2020-12-01 15:26:21,699 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 852 transitions. Word has length 69 [2020-12-01 15:26:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:21,699 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 852 transitions. [2020-12-01 15:26:21,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:26:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 852 transitions. [2020-12-01 15:26:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 15:26:21,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:21,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:21,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-01 15:26:21,701 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1184700246, now seen corresponding path program 1 times [2020-12-01 15:26:21,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:21,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543816743] [2020-12-01 15:26:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:21,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:21,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:21,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:21,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:22,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:22,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-01 15:26:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:22,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-12-01 15:26:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:22,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:22,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543816743] [2020-12-01 15:26:22,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:22,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-12-01 15:26:22,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506247710] [2020-12-01 15:26:22,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-01 15:26:22,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-01 15:26:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2020-12-01 15:26:22,351 INFO L87 Difference]: Start difference. First operand 683 states and 852 transitions. Second operand 23 states. [2020-12-01 15:26:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:26,196 INFO L93 Difference]: Finished difference Result 753 states and 951 transitions. [2020-12-01 15:26:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-01 15:26:26,197 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2020-12-01 15:26:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:26,199 INFO L225 Difference]: With dead ends: 753 [2020-12-01 15:26:26,199 INFO L226 Difference]: Without dead ends: 728 [2020-12-01 15:26:26,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2020-12-01 15:26:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-12-01 15:26:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 679. [2020-12-01 15:26:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2020-12-01 15:26:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 846 transitions. [2020-12-01 15:26:26,209 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 846 transitions. Word has length 71 [2020-12-01 15:26:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:26,209 INFO L481 AbstractCegarLoop]: Abstraction has 679 states and 846 transitions. [2020-12-01 15:26:26,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-01 15:26:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 846 transitions. [2020-12-01 15:26:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-01 15:26:26,211 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:26,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:26,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-01 15:26:26,211 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1018738993, now seen corresponding path program 1 times [2020-12-01 15:26:26,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:26,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736089065] [2020-12-01 15:26:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,363 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:26,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-01 15:26:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:26:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:26,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736089065] [2020-12-01 15:26:26,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:26,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:26:26,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657112589] [2020-12-01 15:26:26,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:26:26,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:26,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:26:26,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:26:26,643 INFO L87 Difference]: Start difference. First operand 679 states and 846 transitions. Second operand 12 states. [2020-12-01 15:26:27,323 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-01 15:26:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:28,964 INFO L93 Difference]: Finished difference Result 728 states and 921 transitions. [2020-12-01 15:26:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:26:28,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2020-12-01 15:26:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:28,967 INFO L225 Difference]: With dead ends: 728 [2020-12-01 15:26:28,967 INFO L226 Difference]: Without dead ends: 723 [2020-12-01 15:26:28,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:26:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-12-01 15:26:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 674. [2020-12-01 15:26:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-12-01 15:26:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 839 transitions. [2020-12-01 15:26:28,977 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 839 transitions. Word has length 70 [2020-12-01 15:26:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:28,978 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 839 transitions. [2020-12-01 15:26:28,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:26:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 839 transitions. [2020-12-01 15:26:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-01 15:26:28,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:28,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:28,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-01 15:26:28,980 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:28,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1587994084, now seen corresponding path program 1 times [2020-12-01 15:26:28,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:28,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097179939] [2020-12-01 15:26:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,153 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:29,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-01 15:26:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:26:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:29,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097179939] [2020-12-01 15:26:29,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:29,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-01 15:26:29,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123961227] [2020-12-01 15:26:29,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-01 15:26:29,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-01 15:26:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:26:29,583 INFO L87 Difference]: Start difference. First operand 674 states and 839 transitions. Second operand 18 states. [2020-12-01 15:26:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:32,597 INFO L93 Difference]: Finished difference Result 747 states and 942 transitions. [2020-12-01 15:26:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-01 15:26:32,598 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-12-01 15:26:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:32,600 INFO L225 Difference]: With dead ends: 747 [2020-12-01 15:26:32,601 INFO L226 Difference]: Without dead ends: 720 [2020-12-01 15:26:32,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2020-12-01 15:26:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-12-01 15:26:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 671. [2020-12-01 15:26:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-12-01 15:26:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 834 transitions. [2020-12-01 15:26:32,616 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 834 transitions. Word has length 70 [2020-12-01 15:26:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:32,616 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 834 transitions. [2020-12-01 15:26:32,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-01 15:26:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 834 transitions. [2020-12-01 15:26:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-01 15:26:32,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:32,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:32,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-01 15:26:32,619 INFO L429 AbstractCegarLoop]: === Iteration 55 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -904685074, now seen corresponding path program 1 times [2020-12-01 15:26:32,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:32,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232236915] [2020-12-01 15:26:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:32,802 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:32,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:32,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:32,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:32,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:33,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:33,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:33,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:33,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232236915] [2020-12-01 15:26:33,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:33,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-01 15:26:33,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547072227] [2020-12-01 15:26:33,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-01 15:26:33,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:33,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-01 15:26:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:26:33,287 INFO L87 Difference]: Start difference. First operand 671 states and 834 transitions. Second operand 18 states. [2020-12-01 15:26:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:36,395 INFO L93 Difference]: Finished difference Result 727 states and 916 transitions. [2020-12-01 15:26:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-01 15:26:36,396 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-12-01 15:26:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:36,397 INFO L225 Difference]: With dead ends: 727 [2020-12-01 15:26:36,397 INFO L226 Difference]: Without dead ends: 724 [2020-12-01 15:26:36,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2020-12-01 15:26:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2020-12-01 15:26:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 669. [2020-12-01 15:26:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-12-01 15:26:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 830 transitions. [2020-12-01 15:26:36,404 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 830 transitions. Word has length 70 [2020-12-01 15:26:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:36,404 INFO L481 AbstractCegarLoop]: Abstraction has 669 states and 830 transitions. [2020-12-01 15:26:36,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-01 15:26:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 830 transitions. [2020-12-01 15:26:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-01 15:26:36,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:36,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:36,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-01 15:26:36,406 INFO L429 AbstractCegarLoop]: === Iteration 56 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash -913266804, now seen corresponding path program 1 times [2020-12-01 15:26:36,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:36,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462270741] [2020-12-01 15:26:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,563 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:26:36,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:36,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462270741] [2020-12-01 15:26:36,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:36,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:26:36,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188218309] [2020-12-01 15:26:36,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:26:36,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:26:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:26:36,753 INFO L87 Difference]: Start difference. First operand 669 states and 830 transitions. Second operand 12 states. [2020-12-01 15:26:37,957 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2020-12-01 15:26:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:39,113 INFO L93 Difference]: Finished difference Result 792 states and 1002 transitions. [2020-12-01 15:26:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:26:39,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2020-12-01 15:26:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:39,115 INFO L225 Difference]: With dead ends: 792 [2020-12-01 15:26:39,115 INFO L226 Difference]: Without dead ends: 734 [2020-12-01 15:26:39,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2020-12-01 15:26:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2020-12-01 15:26:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 613. [2020-12-01 15:26:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2020-12-01 15:26:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 759 transitions. [2020-12-01 15:26:39,125 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 759 transitions. Word has length 70 [2020-12-01 15:26:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:39,126 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 759 transitions. [2020-12-01 15:26:39,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:26:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 759 transitions. [2020-12-01 15:26:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-01 15:26:39,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:39,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:39,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-01 15:26:39,128 INFO L429 AbstractCegarLoop]: === Iteration 57 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1566516177, now seen corresponding path program 1 times [2020-12-01 15:26:39,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:39,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638142985] [2020-12-01 15:26:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-01 15:26:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:26:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:39,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638142985] [2020-12-01 15:26:39,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:39,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:26:39,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547102449] [2020-12-01 15:26:39,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:26:39,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:39,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:26:39,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:26:39,493 INFO L87 Difference]: Start difference. First operand 613 states and 759 transitions. Second operand 13 states. [2020-12-01 15:26:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:41,188 INFO L93 Difference]: Finished difference Result 666 states and 839 transitions. [2020-12-01 15:26:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:26:41,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2020-12-01 15:26:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:41,189 INFO L225 Difference]: With dead ends: 666 [2020-12-01 15:26:41,189 INFO L226 Difference]: Without dead ends: 666 [2020-12-01 15:26:41,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-01 15:26:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-12-01 15:26:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 613. [2020-12-01 15:26:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2020-12-01 15:26:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 758 transitions. [2020-12-01 15:26:41,200 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 758 transitions. Word has length 72 [2020-12-01 15:26:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:41,200 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 758 transitions. [2020-12-01 15:26:41,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:26:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 758 transitions. [2020-12-01 15:26:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 15:26:41,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:41,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:41,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-12-01 15:26:41,202 INFO L429 AbstractCegarLoop]: === Iteration 58 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 865456770, now seen corresponding path program 1 times [2020-12-01 15:26:41,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:41,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115215670] [2020-12-01 15:26:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:26:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:26:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:41,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115215670] [2020-12-01 15:26:41,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:41,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-01 15:26:41,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748201425] [2020-12-01 15:26:41,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-01 15:26:41,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:41,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-01 15:26:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:26:41,637 INFO L87 Difference]: Start difference. First operand 613 states and 758 transitions. Second operand 21 states. [2020-12-01 15:26:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:44,465 INFO L93 Difference]: Finished difference Result 699 states and 882 transitions. [2020-12-01 15:26:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:26:44,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2020-12-01 15:26:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:44,467 INFO L225 Difference]: With dead ends: 699 [2020-12-01 15:26:44,467 INFO L226 Difference]: Without dead ends: 677 [2020-12-01 15:26:44,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2020-12-01 15:26:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-12-01 15:26:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 611. [2020-12-01 15:26:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-12-01 15:26:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 754 transitions. [2020-12-01 15:26:44,476 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 754 transitions. Word has length 75 [2020-12-01 15:26:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:44,477 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 754 transitions. [2020-12-01 15:26:44,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-01 15:26:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 754 transitions. [2020-12-01 15:26:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-01 15:26:44,478 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:44,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:44,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-12-01 15:26:44,479 INFO L429 AbstractCegarLoop]: === Iteration 59 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1884445617, now seen corresponding path program 1 times [2020-12-01 15:26:44,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:44,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316403156] [2020-12-01 15:26:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-01 15:26:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:26:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:44,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:45,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316403156] [2020-12-01 15:26:45,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:45,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-01 15:26:45,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53387808] [2020-12-01 15:26:45,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-01 15:26:45,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-01 15:26:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:26:45,016 INFO L87 Difference]: Start difference. First operand 611 states and 754 transitions. Second operand 21 states. [2020-12-01 15:26:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:47,560 INFO L93 Difference]: Finished difference Result 696 states and 875 transitions. [2020-12-01 15:26:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:26:47,560 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2020-12-01 15:26:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:47,561 INFO L225 Difference]: With dead ends: 696 [2020-12-01 15:26:47,561 INFO L226 Difference]: Without dead ends: 661 [2020-12-01 15:26:47,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2020-12-01 15:26:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-12-01 15:26:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 606. [2020-12-01 15:26:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2020-12-01 15:26:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 744 transitions. [2020-12-01 15:26:47,570 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 744 transitions. Word has length 72 [2020-12-01 15:26:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:47,571 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 744 transitions. [2020-12-01 15:26:47,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-01 15:26:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 744 transitions. [2020-12-01 15:26:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-01 15:26:47,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:47,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:47,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-12-01 15:26:47,573 INFO L429 AbstractCegarLoop]: === Iteration 60 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash 538185646, now seen corresponding path program 1 times [2020-12-01 15:26:47,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:47,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313630786] [2020-12-01 15:26:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-01 15:26:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:26:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:47,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313630786] [2020-12-01 15:26:47,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:47,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:26:47,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878636592] [2020-12-01 15:26:47,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:26:47,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:26:47,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:26:47,918 INFO L87 Difference]: Start difference. First operand 606 states and 744 transitions. Second operand 13 states. [2020-12-01 15:26:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:49,740 INFO L93 Difference]: Finished difference Result 656 states and 818 transitions. [2020-12-01 15:26:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:26:49,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2020-12-01 15:26:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:49,742 INFO L225 Difference]: With dead ends: 656 [2020-12-01 15:26:49,742 INFO L226 Difference]: Without dead ends: 650 [2020-12-01 15:26:49,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-01 15:26:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-12-01 15:26:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 600. [2020-12-01 15:26:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-12-01 15:26:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 736 transitions. [2020-12-01 15:26:49,748 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 736 transitions. Word has length 72 [2020-12-01 15:26:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:49,748 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 736 transitions. [2020-12-01 15:26:49,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:26:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2020-12-01 15:26:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 15:26:49,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:49,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:49,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-12-01 15:26:49,749 INFO L429 AbstractCegarLoop]: === Iteration 61 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -646602639, now seen corresponding path program 1 times [2020-12-01 15:26:49,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:49,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455701986] [2020-12-01 15:26:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:49,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:49,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:49,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:49,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:49,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:50,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:26:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:50,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:50,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-01 15:26:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:50,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:50,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455701986] [2020-12-01 15:26:50,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:50,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-01 15:26:50,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881430289] [2020-12-01 15:26:50,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-01 15:26:50,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-01 15:26:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-12-01 15:26:50,162 INFO L87 Difference]: Start difference. First operand 600 states and 736 transitions. Second operand 21 states. [2020-12-01 15:26:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:52,409 INFO L93 Difference]: Finished difference Result 672 states and 836 transitions. [2020-12-01 15:26:52,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:26:52,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2020-12-01 15:26:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:52,411 INFO L225 Difference]: With dead ends: 672 [2020-12-01 15:26:52,411 INFO L226 Difference]: Without dead ends: 646 [2020-12-01 15:26:52,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2020-12-01 15:26:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-12-01 15:26:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 598. [2020-12-01 15:26:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2020-12-01 15:26:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 733 transitions. [2020-12-01 15:26:52,417 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 733 transitions. Word has length 78 [2020-12-01 15:26:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:52,417 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 733 transitions. [2020-12-01 15:26:52,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-01 15:26:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 733 transitions. [2020-12-01 15:26:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:26:52,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:52,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:52,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-12-01 15:26:52,419 INFO L429 AbstractCegarLoop]: === Iteration 62 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1064500393, now seen corresponding path program 1 times [2020-12-01 15:26:52,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:52,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394224885] [2020-12-01 15:26:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:26:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-01 15:26:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:52,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394224885] [2020-12-01 15:26:52,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:52,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:26:52,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457747222] [2020-12-01 15:26:52,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:26:52,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:52,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:26:52,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:26:52,730 INFO L87 Difference]: Start difference. First operand 598 states and 733 transitions. Second operand 13 states. [2020-12-01 15:26:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:54,361 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2020-12-01 15:26:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:26:54,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2020-12-01 15:26:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:54,364 INFO L225 Difference]: With dead ends: 645 [2020-12-01 15:26:54,364 INFO L226 Difference]: Without dead ends: 634 [2020-12-01 15:26:54,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-01 15:26:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-12-01 15:26:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 586. [2020-12-01 15:26:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-12-01 15:26:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 715 transitions. [2020-12-01 15:26:54,370 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 715 transitions. Word has length 74 [2020-12-01 15:26:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:54,370 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 715 transitions. [2020-12-01 15:26:54,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:26:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 715 transitions. [2020-12-01 15:26:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:26:54,371 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:54,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:54,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-12-01 15:26:54,371 INFO L429 AbstractCegarLoop]: === Iteration 63 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 988468753, now seen corresponding path program 1 times [2020-12-01 15:26:54,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:54,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31931558] [2020-12-01 15:26:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-01 15:26:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:54,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31931558] [2020-12-01 15:26:54,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:54,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 15:26:54,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348565872] [2020-12-01 15:26:54,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 15:26:54,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 15:26:54,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:26:54,672 INFO L87 Difference]: Start difference. First operand 586 states and 715 transitions. Second operand 11 states. [2020-12-01 15:26:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:26:55,825 INFO L93 Difference]: Finished difference Result 656 states and 810 transitions. [2020-12-01 15:26:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:26:55,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-12-01 15:26:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:26:55,826 INFO L225 Difference]: With dead ends: 656 [2020-12-01 15:26:55,826 INFO L226 Difference]: Without dead ends: 656 [2020-12-01 15:26:55,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:26:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-12-01 15:26:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 595. [2020-12-01 15:26:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2020-12-01 15:26:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 725 transitions. [2020-12-01 15:26:55,832 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 725 transitions. Word has length 74 [2020-12-01 15:26:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:26:55,832 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 725 transitions. [2020-12-01 15:26:55,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 15:26:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 725 transitions. [2020-12-01 15:26:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:26:55,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:26:55,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:26:55,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-12-01 15:26:55,834 INFO L429 AbstractCegarLoop]: === Iteration 64 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:26:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:26:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1501060209, now seen corresponding path program 1 times [2020-12-01 15:26:55,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:26:55,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307889919] [2020-12-01 15:26:55,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:26:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:55,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:26:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:55,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:26:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:55,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:26:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:56,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:26:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:56,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:56,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:26:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:56,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:26:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:56,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-01 15:26:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:26:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:26:56,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307889919] [2020-12-01 15:26:56,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:26:56,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-01 15:26:56,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167109853] [2020-12-01 15:26:56,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:26:56,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:26:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:26:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:26:56,237 INFO L87 Difference]: Start difference. First operand 595 states and 725 transitions. Second operand 19 states. [2020-12-01 15:26:59,043 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2020-12-01 15:26:59,294 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2020-12-01 15:27:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:01,550 INFO L93 Difference]: Finished difference Result 1255 states and 1557 transitions. [2020-12-01 15:27:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-12-01 15:27:01,551 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2020-12-01 15:27:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:01,553 INFO L225 Difference]: With dead ends: 1255 [2020-12-01 15:27:01,553 INFO L226 Difference]: Without dead ends: 1225 [2020-12-01 15:27:01,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=614, Invalid=2356, Unknown=0, NotChecked=0, Total=2970 [2020-12-01 15:27:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-12-01 15:27:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 915. [2020-12-01 15:27:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-12-01 15:27:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1135 transitions. [2020-12-01 15:27:01,570 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1135 transitions. Word has length 74 [2020-12-01 15:27:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:01,570 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1135 transitions. [2020-12-01 15:27:01,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:27:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1135 transitions. [2020-12-01 15:27:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:27:01,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:01,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:01,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-12-01 15:27:01,573 INFO L429 AbstractCegarLoop]: === Iteration 65 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1918456815, now seen corresponding path program 1 times [2020-12-01 15:27:01,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:01,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137260329] [2020-12-01 15:27:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,728 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:27:01,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:27:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:27:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-01 15:27:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:01,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137260329] [2020-12-01 15:27:01,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:01,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-01 15:27:01,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980888821] [2020-12-01 15:27:01,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-01 15:27:01,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-01 15:27:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:27:01,973 INFO L87 Difference]: Start difference. First operand 915 states and 1135 transitions. Second operand 14 states. [2020-12-01 15:27:02,265 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2020-12-01 15:27:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:04,849 INFO L93 Difference]: Finished difference Result 1163 states and 1450 transitions. [2020-12-01 15:27:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-01 15:27:04,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2020-12-01 15:27:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:04,852 INFO L225 Difference]: With dead ends: 1163 [2020-12-01 15:27:04,852 INFO L226 Difference]: Without dead ends: 1163 [2020-12-01 15:27:04,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2020-12-01 15:27:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-12-01 15:27:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1006. [2020-12-01 15:27:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2020-12-01 15:27:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1244 transitions. [2020-12-01 15:27:04,872 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1244 transitions. Word has length 74 [2020-12-01 15:27:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:04,872 INFO L481 AbstractCegarLoop]: Abstraction has 1006 states and 1244 transitions. [2020-12-01 15:27:04,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-01 15:27:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1244 transitions. [2020-12-01 15:27:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-01 15:27:04,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:04,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:04,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-12-01 15:27:04,875 INFO L429 AbstractCegarLoop]: === Iteration 66 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1538994344, now seen corresponding path program 1 times [2020-12-01 15:27:04,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:04,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634917670] [2020-12-01 15:27:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:04,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:27:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:27:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:27:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:27:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:05,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634917670] [2020-12-01 15:27:05,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:05,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-01 15:27:05,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427845951] [2020-12-01 15:27:05,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-01 15:27:05,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:05,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-01 15:27:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:27:05,206 INFO L87 Difference]: Start difference. First operand 1006 states and 1244 transitions. Second operand 15 states. [2020-12-01 15:27:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:06,783 INFO L93 Difference]: Finished difference Result 1098 states and 1376 transitions. [2020-12-01 15:27:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:27:06,784 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2020-12-01 15:27:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:06,785 INFO L225 Difference]: With dead ends: 1098 [2020-12-01 15:27:06,785 INFO L226 Difference]: Without dead ends: 1068 [2020-12-01 15:27:06,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:27:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2020-12-01 15:27:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 988. [2020-12-01 15:27:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2020-12-01 15:27:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1216 transitions. [2020-12-01 15:27:06,796 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1216 transitions. Word has length 76 [2020-12-01 15:27:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:06,796 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1216 transitions. [2020-12-01 15:27:06,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-01 15:27:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1216 transitions. [2020-12-01 15:27:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:27:06,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:06,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:06,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-12-01 15:27:06,799 INFO L429 AbstractCegarLoop]: === Iteration 67 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash -583929044, now seen corresponding path program 1 times [2020-12-01 15:27:06,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:06,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195094402] [2020-12-01 15:27:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:06,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:06,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:06,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:06,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:06,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:07,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-01 15:27:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:07,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-12-01 15:27:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:07,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195094402] [2020-12-01 15:27:07,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:07,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:27:07,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658994401] [2020-12-01 15:27:07,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:27:07,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:27:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:27:07,108 INFO L87 Difference]: Start difference. First operand 988 states and 1216 transitions. Second operand 12 states. [2020-12-01 15:27:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:08,519 INFO L93 Difference]: Finished difference Result 1064 states and 1328 transitions. [2020-12-01 15:27:08,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:27:08,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2020-12-01 15:27:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:08,521 INFO L225 Difference]: With dead ends: 1064 [2020-12-01 15:27:08,521 INFO L226 Difference]: Without dead ends: 1052 [2020-12-01 15:27:08,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:27:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-12-01 15:27:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 972. [2020-12-01 15:27:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-12-01 15:27:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1192 transitions. [2020-12-01 15:27:08,539 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1192 transitions. Word has length 74 [2020-12-01 15:27:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:08,539 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 1192 transitions. [2020-12-01 15:27:08,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:27:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1192 transitions. [2020-12-01 15:27:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 15:27:08,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:08,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:08,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-12-01 15:27:08,542 INFO L429 AbstractCegarLoop]: === Iteration 68 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 479843728, now seen corresponding path program 1 times [2020-12-01 15:27:08,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:08,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515781321] [2020-12-01 15:27:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-01 15:27:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-12-01 15:27:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:08,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515781321] [2020-12-01 15:27:08,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:08,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:27:08,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992836092] [2020-12-01 15:27:08,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:27:08,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:27:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:27:08,973 INFO L87 Difference]: Start difference. First operand 972 states and 1192 transitions. Second operand 13 states. [2020-12-01 15:27:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:10,362 INFO L93 Difference]: Finished difference Result 1038 states and 1290 transitions. [2020-12-01 15:27:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:27:10,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2020-12-01 15:27:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:10,364 INFO L225 Difference]: With dead ends: 1038 [2020-12-01 15:27:10,364 INFO L226 Difference]: Without dead ends: 1038 [2020-12-01 15:27:10,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:27:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2020-12-01 15:27:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 958. [2020-12-01 15:27:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2020-12-01 15:27:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1170 transitions. [2020-12-01 15:27:10,380 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1170 transitions. Word has length 78 [2020-12-01 15:27:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:10,380 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1170 transitions. [2020-12-01 15:27:10,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:27:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1170 transitions. [2020-12-01 15:27:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-01 15:27:10,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:10,383 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:10,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-12-01 15:27:10,383 INFO L429 AbstractCegarLoop]: === Iteration 69 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -614062896, now seen corresponding path program 1 times [2020-12-01 15:27:10,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:10,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453409400] [2020-12-01 15:27:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-12-01 15:27:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-01 15:27:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 15:27:10,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453409400] [2020-12-01 15:27:10,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:10,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:27:10,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779983317] [2020-12-01 15:27:10,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:27:10,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:27:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:27:10,710 INFO L87 Difference]: Start difference. First operand 958 states and 1170 transitions. Second operand 12 states. [2020-12-01 15:27:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:12,187 INFO L93 Difference]: Finished difference Result 1038 states and 1288 transitions. [2020-12-01 15:27:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:27:12,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2020-12-01 15:27:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:12,189 INFO L225 Difference]: With dead ends: 1038 [2020-12-01 15:27:12,189 INFO L226 Difference]: Without dead ends: 1018 [2020-12-01 15:27:12,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:27:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-12-01 15:27:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 938. [2020-12-01 15:27:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2020-12-01 15:27:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1142 transitions. [2020-12-01 15:27:12,201 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1142 transitions. Word has length 76 [2020-12-01 15:27:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:12,201 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1142 transitions. [2020-12-01 15:27:12,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:27:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1142 transitions. [2020-12-01 15:27:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 15:27:12,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:12,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:12,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-12-01 15:27:12,204 INFO L429 AbstractCegarLoop]: === Iteration 70 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash -264722451, now seen corresponding path program 1 times [2020-12-01 15:27:12,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:12,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532941519] [2020-12-01 15:27:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:27:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-01 15:27:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:12,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532941519] [2020-12-01 15:27:12,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:12,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:27:12,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521128935] [2020-12-01 15:27:12,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:27:12,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:27:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:27:12,574 INFO L87 Difference]: Start difference. First operand 938 states and 1142 transitions. Second operand 13 states. [2020-12-01 15:27:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:13,992 INFO L93 Difference]: Finished difference Result 962 states and 1176 transitions. [2020-12-01 15:27:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:27:13,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2020-12-01 15:27:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:13,994 INFO L225 Difference]: With dead ends: 962 [2020-12-01 15:27:13,994 INFO L226 Difference]: Without dead ends: 926 [2020-12-01 15:27:13,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-01 15:27:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2020-12-01 15:27:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 874. [2020-12-01 15:27:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2020-12-01 15:27:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1056 transitions. [2020-12-01 15:27:14,009 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1056 transitions. Word has length 79 [2020-12-01 15:27:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:14,009 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1056 transitions. [2020-12-01 15:27:14,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:27:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1056 transitions. [2020-12-01 15:27:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 15:27:14,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:14,012 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:14,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-12-01 15:27:14,013 INFO L429 AbstractCegarLoop]: === Iteration 71 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 34860000, now seen corresponding path program 1 times [2020-12-01 15:27:14,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:14,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137416280] [2020-12-01 15:27:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-01 15:27:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-01 15:27:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-12-01 15:27:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 15:27:14,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137416280] [2020-12-01 15:27:14,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326491879] [2020-12-01 15:27:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:27:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:14,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-01 15:27:14,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:27:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:14,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:27:14,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 12 [2020-12-01 15:27:14,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491033401] [2020-12-01 15:27:14,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:27:14,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:27:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:27:14,880 INFO L87 Difference]: Start difference. First operand 874 states and 1056 transitions. Second operand 5 states. [2020-12-01 15:27:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:14,892 INFO L93 Difference]: Finished difference Result 841 states and 1016 transitions. [2020-12-01 15:27:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:27:14,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-12-01 15:27:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:14,898 INFO L225 Difference]: With dead ends: 841 [2020-12-01 15:27:14,911 INFO L226 Difference]: Without dead ends: 813 [2020-12-01 15:27:14,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:27:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-12-01 15:27:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2020-12-01 15:27:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2020-12-01 15:27:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 986 transitions. [2020-12-01 15:27:14,964 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 986 transitions. Word has length 78 [2020-12-01 15:27:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:14,965 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 986 transitions. [2020-12-01 15:27:14,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:27:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 986 transitions. [2020-12-01 15:27:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-01 15:27:14,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:14,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:15,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2020-12-01 15:27:15,184 INFO L429 AbstractCegarLoop]: === Iteration 72 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1251525641, now seen corresponding path program 1 times [2020-12-01 15:27:15,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:15,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597205613] [2020-12-01 15:27:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,373 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:27:15,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-01 15:27:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-12-01 15:27:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:15,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597205613] [2020-12-01 15:27:15,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:15,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-01 15:27:15,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186771090] [2020-12-01 15:27:15,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-01 15:27:15,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-01 15:27:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-01 15:27:15,720 INFO L87 Difference]: Start difference. First operand 813 states and 986 transitions. Second operand 14 states. [2020-12-01 15:27:15,904 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-01 15:27:16,058 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-12-01 15:27:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:17,347 INFO L93 Difference]: Finished difference Result 865 states and 1056 transitions. [2020-12-01 15:27:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:27:17,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2020-12-01 15:27:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:17,350 INFO L225 Difference]: With dead ends: 865 [2020-12-01 15:27:17,350 INFO L226 Difference]: Without dead ends: 865 [2020-12-01 15:27:17,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2020-12-01 15:27:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2020-12-01 15:27:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 813. [2020-12-01 15:27:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2020-12-01 15:27:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 982 transitions. [2020-12-01 15:27:17,369 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 982 transitions. Word has length 82 [2020-12-01 15:27:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:17,370 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 982 transitions. [2020-12-01 15:27:17,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-01 15:27:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 982 transitions. [2020-12-01 15:27:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 15:27:17,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:17,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:17,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-12-01 15:27:17,373 INFO L429 AbstractCegarLoop]: === Iteration 73 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash 669936891, now seen corresponding path program 1 times [2020-12-01 15:27:17,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:17,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856251920] [2020-12-01 15:27:17,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:27:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-01 15:27:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:17,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856251920] [2020-12-01 15:27:17,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:17,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-01 15:27:17,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070753163] [2020-12-01 15:27:17,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-01 15:27:17,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:17,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-01 15:27:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:27:17,898 INFO L87 Difference]: Start difference. First operand 813 states and 982 transitions. Second operand 18 states. [2020-12-01 15:27:18,034 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-01 15:27:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:21,596 INFO L93 Difference]: Finished difference Result 812 states and 988 transitions. [2020-12-01 15:27:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-01 15:27:21,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-12-01 15:27:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:21,599 INFO L225 Difference]: With dead ends: 812 [2020-12-01 15:27:21,599 INFO L226 Difference]: Without dead ends: 772 [2020-12-01 15:27:21,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2020-12-01 15:27:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-12-01 15:27:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 369. [2020-12-01 15:27:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-12-01 15:27:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 445 transitions. [2020-12-01 15:27:21,611 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 445 transitions. Word has length 79 [2020-12-01 15:27:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:21,611 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 445 transitions. [2020-12-01 15:27:21,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-01 15:27:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 445 transitions. [2020-12-01 15:27:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-01 15:27:21,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:21,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:21,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-12-01 15:27:21,613 INFO L429 AbstractCegarLoop]: === Iteration 74 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash -611023918, now seen corresponding path program 1 times [2020-12-01 15:27:21,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:21,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284703528] [2020-12-01 15:27:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:21,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:21,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:21,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:21,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-01 15:27:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:21,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:21,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-01 15:27:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:22,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-12-01 15:27:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:22,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-01 15:27:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:22,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284703528] [2020-12-01 15:27:22,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:22,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-01 15:27:22,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957242605] [2020-12-01 15:27:22,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:27:22,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:27:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:27:22,097 INFO L87 Difference]: Start difference. First operand 369 states and 445 transitions. Second operand 20 states. [2020-12-01 15:27:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:23,694 INFO L93 Difference]: Finished difference Result 394 states and 480 transitions. [2020-12-01 15:27:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:27:23,695 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2020-12-01 15:27:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:23,696 INFO L225 Difference]: With dead ends: 394 [2020-12-01 15:27:23,697 INFO L226 Difference]: Without dead ends: 309 [2020-12-01 15:27:23,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-12-01 15:27:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-12-01 15:27:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 292. [2020-12-01 15:27:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-12-01 15:27:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 356 transitions. [2020-12-01 15:27:23,704 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 356 transitions. Word has length 80 [2020-12-01 15:27:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:23,704 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 356 transitions. [2020-12-01 15:27:23,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:27:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 356 transitions. [2020-12-01 15:27:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-01 15:27:23,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:23,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:23,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-12-01 15:27:23,706 INFO L429 AbstractCegarLoop]: === Iteration 75 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1203392466, now seen corresponding path program 1 times [2020-12-01 15:27:23,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:23,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687840510] [2020-12-01 15:27:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:23,848 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:27:23,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:23,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:23,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:23,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-01 15:27:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:23,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:23,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:24,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:24,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:24,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:24,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:24,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687840510] [2020-12-01 15:27:24,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:24,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 15:27:24,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086987032] [2020-12-01 15:27:24,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 15:27:24,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 15:27:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:27:24,090 INFO L87 Difference]: Start difference. First operand 292 states and 356 transitions. Second operand 12 states. [2020-12-01 15:27:24,220 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-01 15:27:24,428 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-01 15:27:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:25,135 INFO L93 Difference]: Finished difference Result 303 states and 354 transitions. [2020-12-01 15:27:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-01 15:27:25,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2020-12-01 15:27:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:25,137 INFO L225 Difference]: With dead ends: 303 [2020-12-01 15:27:25,138 INFO L226 Difference]: Without dead ends: 303 [2020-12-01 15:27:25,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:27:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-01 15:27:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 253. [2020-12-01 15:27:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-12-01 15:27:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 291 transitions. [2020-12-01 15:27:25,144 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 291 transitions. Word has length 84 [2020-12-01 15:27:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:25,144 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 291 transitions. [2020-12-01 15:27:25,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 15:27:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 291 transitions. [2020-12-01 15:27:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-01 15:27:25,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:25,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:25,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-12-01 15:27:25,146 INFO L429 AbstractCegarLoop]: === Iteration 76 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash 624250995, now seen corresponding path program 1 times [2020-12-01 15:27:25,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:25,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501916828] [2020-12-01 15:27:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:27:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:27:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-12-01 15:27:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:25,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501916828] [2020-12-01 15:27:25,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:25,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-01 15:27:25,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792912951] [2020-12-01 15:27:25,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-01 15:27:25,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-01 15:27:25,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:27:25,700 INFO L87 Difference]: Start difference. First operand 253 states and 291 transitions. Second operand 18 states. [2020-12-01 15:27:26,023 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-12-01 15:27:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:27,213 INFO L93 Difference]: Finished difference Result 309 states and 352 transitions. [2020-12-01 15:27:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-01 15:27:27,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 100 [2020-12-01 15:27:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:27,215 INFO L225 Difference]: With dead ends: 309 [2020-12-01 15:27:27,215 INFO L226 Difference]: Without dead ends: 280 [2020-12-01 15:27:27,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2020-12-01 15:27:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-01 15:27:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 252. [2020-12-01 15:27:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-01 15:27:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 287 transitions. [2020-12-01 15:27:27,219 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 287 transitions. Word has length 100 [2020-12-01 15:27:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:27,219 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 287 transitions. [2020-12-01 15:27:27,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-01 15:27:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 287 transitions. [2020-12-01 15:27:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 15:27:27,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:27,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:27,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-12-01 15:27:27,221 INFO L429 AbstractCegarLoop]: === Iteration 77 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -621919017, now seen corresponding path program 1 times [2020-12-01 15:27:27,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:27,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597240667] [2020-12-01 15:27:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:27:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:27:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-12-01 15:27:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:27,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597240667] [2020-12-01 15:27:27,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:27,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-01 15:27:27,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432910694] [2020-12-01 15:27:27,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:27:27,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:27,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:27:27,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:27:27,776 INFO L87 Difference]: Start difference. First operand 252 states and 287 transitions. Second operand 19 states. [2020-12-01 15:27:27,964 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 99 [2020-12-01 15:27:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:29,995 INFO L93 Difference]: Finished difference Result 503 states and 571 transitions. [2020-12-01 15:27:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-01 15:27:29,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2020-12-01 15:27:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:29,997 INFO L225 Difference]: With dead ends: 503 [2020-12-01 15:27:29,997 INFO L226 Difference]: Without dead ends: 498 [2020-12-01 15:27:29,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2020-12-01 15:27:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-12-01 15:27:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 370. [2020-12-01 15:27:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-12-01 15:27:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 419 transitions. [2020-12-01 15:27:30,006 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 419 transitions. Word has length 102 [2020-12-01 15:27:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:30,006 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 419 transitions. [2020-12-01 15:27:30,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:27:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 419 transitions. [2020-12-01 15:27:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 15:27:30,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:30,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:30,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-12-01 15:27:30,009 INFO L429 AbstractCegarLoop]: === Iteration 78 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1732466265, now seen corresponding path program 1 times [2020-12-01 15:27:30,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:30,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711323833] [2020-12-01 15:27:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,164 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:27:30,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:27:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-01 15:27:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-12-01 15:27:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:30,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711323833] [2020-12-01 15:27:30,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:30,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-01 15:27:30,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137327713] [2020-12-01 15:27:30,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-01 15:27:30,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-01 15:27:30,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-12-01 15:27:30,537 INFO L87 Difference]: Start difference. First operand 370 states and 419 transitions. Second operand 17 states. [2020-12-01 15:27:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:31,246 INFO L93 Difference]: Finished difference Result 408 states and 465 transitions. [2020-12-01 15:27:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 15:27:31,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2020-12-01 15:27:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:31,248 INFO L225 Difference]: With dead ends: 408 [2020-12-01 15:27:31,248 INFO L226 Difference]: Without dead ends: 355 [2020-12-01 15:27:31,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:27:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-12-01 15:27:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 150. [2020-12-01 15:27:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-01 15:27:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2020-12-01 15:27:31,255 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 102 [2020-12-01 15:27:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:31,255 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2020-12-01 15:27:31,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-01 15:27:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2020-12-01 15:27:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 15:27:31,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:31,257 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:31,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-12-01 15:27:31,257 INFO L429 AbstractCegarLoop]: === Iteration 79 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:31,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1564556985, now seen corresponding path program 1 times [2020-12-01 15:27:31,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:31,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975845468] [2020-12-01 15:27:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,396 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-01 15:27:31,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:27:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-12-01 15:27:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-12-01 15:27:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-01 15:27:31,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975845468] [2020-12-01 15:27:31,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:31,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-01 15:27:31,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67860003] [2020-12-01 15:27:31,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:27:31,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:27:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:27:31,676 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 13 states. [2020-12-01 15:27:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:32,310 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2020-12-01 15:27:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:27:32,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-12-01 15:27:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:32,311 INFO L225 Difference]: With dead ends: 162 [2020-12-01 15:27:32,311 INFO L226 Difference]: Without dead ends: 162 [2020-12-01 15:27:32,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:27:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-01 15:27:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2020-12-01 15:27:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-12-01 15:27:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2020-12-01 15:27:32,314 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 116 [2020-12-01 15:27:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:32,315 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2020-12-01 15:27:32,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:27:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2020-12-01 15:27:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 15:27:32,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:32,316 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:32,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2020-12-01 15:27:32,316 INFO L429 AbstractCegarLoop]: === Iteration 80 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash -279261300, now seen corresponding path program 1 times [2020-12-01 15:27:32,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:32,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608958934] [2020-12-01 15:27:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:27:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-01 15:27:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-12-01 15:27:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-12-01 15:27:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-01 15:27:32,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608958934] [2020-12-01 15:27:32,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:32,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-01 15:27:32,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66140600] [2020-12-01 15:27:32,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-01 15:27:32,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-01 15:27:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-12-01 15:27:32,717 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand 18 states. [2020-12-01 15:27:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:33,947 INFO L93 Difference]: Finished difference Result 262 states and 284 transitions. [2020-12-01 15:27:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-01 15:27:33,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2020-12-01 15:27:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:33,948 INFO L225 Difference]: With dead ends: 262 [2020-12-01 15:27:33,948 INFO L226 Difference]: Without dead ends: 156 [2020-12-01 15:27:33,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2020-12-01 15:27:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-01 15:27:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-12-01 15:27:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-12-01 15:27:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2020-12-01 15:27:33,950 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 117 [2020-12-01 15:27:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:33,950 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2020-12-01 15:27:33,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-01 15:27:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2020-12-01 15:27:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 15:27:33,951 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:33,951 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:33,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-12-01 15:27:33,952 INFO L429 AbstractCegarLoop]: === Iteration 81 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-12-01 15:27:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash -902542902, now seen corresponding path program 1 times [2020-12-01 15:27:33,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:33,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783915960] [2020-12-01 15:27:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-01 15:27:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-01 15:27:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-01 15:27:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-01 15:27:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-01 15:27:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-01 15:27:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-01 15:27:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-01 15:27:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-01 15:27:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-12-01 15:27:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-12-01 15:27:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-01 15:27:34,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783915960] [2020-12-01 15:27:34,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:34,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-01 15:27:34,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756568557] [2020-12-01 15:27:34,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:27:34,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:34,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:27:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:27:34,513 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 20 states. [2020-12-01 15:27:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:35,691 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2020-12-01 15:27:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-01 15:27:35,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 117 [2020-12-01 15:27:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:35,692 INFO L225 Difference]: With dead ends: 152 [2020-12-01 15:27:35,692 INFO L226 Difference]: Without dead ends: 0 [2020-12-01 15:27:35,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2020-12-01 15:27:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-01 15:27:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-01 15:27:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-01 15:27:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-01 15:27:35,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2020-12-01 15:27:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:35,693 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-01 15:27:35,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:27:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-01 15:27:35,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-01 15:27:35,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-12-01 15:27:35,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:27:35 BoogieIcfgContainer [2020-12-01 15:27:35,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:27:35,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:27:35,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:27:35,699 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:27:35,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:23:13" (3/4) ... [2020-12-01 15:27:35,703 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-01 15:27:35,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-12-01 15:27:35,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2020-12-01 15:27:35,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2020-12-01 15:27:35,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2020-12-01 15:27:35,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-12-01 15:27:35,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2020-12-01 15:27:35,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2020-12-01 15:27:35,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2020-12-01 15:27:35,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2020-12-01 15:27:35,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2020-12-01 15:27:35,715 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2020-12-01 15:27:35,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2020-12-01 15:27:35,762 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2020-12-01 15:27:35,766 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-01 15:27:35,770 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:27:35,976 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e108628-513c-41ec-bab5-5479f5522307/bin/uautomizer/witness.graphml [2020-12-01 15:27:35,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:27:35,977 INFO L168 Benchmark]: Toolchain (without parser) took 264863.22 ms. Allocated memory was 90.2 MB in the beginning and 755.0 MB in the end (delta: 664.8 MB). Free memory was 55.8 MB in the beginning and 320.4 MB in the end (delta: -264.6 MB). Peak memory consumption was 399.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:35,978 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 71.3 MB. Free memory was 31.9 MB in the beginning and 31.8 MB in the end (delta: 43.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:27:35,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.57 ms. Allocated memory is still 90.2 MB. Free memory was 55.7 MB in the beginning and 46.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:35,978 INFO L168 Benchmark]: Boogie Preprocessor took 194.93 ms. Allocated memory is still 90.2 MB. Free memory was 46.5 MB in the beginning and 41.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:35,979 INFO L168 Benchmark]: RCFGBuilder took 1835.10 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 41.4 MB in the beginning and 46.3 MB in the end (delta: -4.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:35,979 INFO L168 Benchmark]: TraceAbstraction took 261710.91 ms. Allocated memory was 111.1 MB in the beginning and 755.0 MB in the end (delta: 643.8 MB). Free memory was 45.1 MB in the beginning and 355.0 MB in the end (delta: -309.9 MB). Peak memory consumption was 333.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:35,980 INFO L168 Benchmark]: Witness Printer took 277.91 ms. Allocated memory is still 755.0 MB. Free memory was 355.0 MB in the beginning and 320.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:35,982 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60 ms. Allocated memory is still 71.3 MB. Free memory was 31.9 MB in the beginning and 31.8 MB in the end (delta: 43.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 837.57 ms. Allocated memory is still 90.2 MB. Free memory was 55.7 MB in the beginning and 46.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 194.93 ms. Allocated memory is still 90.2 MB. Free memory was 46.5 MB in the beginning and 41.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1835.10 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 41.4 MB in the beginning and 46.3 MB in the end (delta: -4.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 261710.91 ms. Allocated memory was 111.1 MB in the beginning and 755.0 MB in the end (delta: 643.8 MB). Free memory was 45.1 MB in the beginning and 355.0 MB in the end (delta: -309.9 MB). Peak memory consumption was 333.7 MB. Max. memory is 16.1 GB. * Witness Printer took 277.91 ms. Allocated memory is still 755.0 MB. Free memory was 355.0 MB in the beginning and 320.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1717]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 520 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 261.6s, OverallIterations: 81, TraceHistogramMax: 2, AutomataDifference: 226.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42673 SDtfs, 67302 SDslu, 106335 SDs, 0 SdLazy, 189027 SolverSat, 23541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 160.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2366 GetRequests, 990 SyntacticMatches, 3 SemanticMatches, 1373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 45.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 81 MinimizatonAttempts, 9728 StatesRemovedByMinimization, 78 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 5322 NumberOfCodeBlocks, 5322 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 5240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1793247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 945 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 82 InterpolantComputations, 81 PerfectInterpolantSequences, 43/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...