./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bca5bbd8ac33ab1d58a01dd560e5e3d6c95b5dc081f89e35a635c59fa2143ad ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:04:30,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:04:30,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:04:30,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:04:30,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:04:30,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:04:30,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:04:30,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:04:30,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:04:30,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:04:30,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:04:30,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:04:30,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:04:30,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:04:30,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:04:30,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:04:30,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:04:30,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:04:30,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:04:30,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:04:30,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:04:30,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:04:30,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:04:30,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:04:30,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:04:30,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:04:30,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:04:30,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:04:30,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:04:30,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:04:30,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:04:30,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:04:30,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:04:30,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:04:30,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:04:30,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:04:30,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:04:30,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:04:30,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:04:30,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:04:30,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:04:30,451 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:04:30,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:04:30,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:04:30,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:04:30,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:04:30,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:04:30,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:04:30,517 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:04:30,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:04:30,518 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:04:30,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:04:30,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:04:30,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:04:30,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:04:30,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:04:30,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:04:30,521 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:04:30,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:04:30,522 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:04:30,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:04:30,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:04:30,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:04:30,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:04:30,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:04:30,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:04:30,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:04:30,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:04:30,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:04:30,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:04:30,525 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:04:30,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:04:30,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:04:30,526 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:04:30,527 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_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/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_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg 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 ! call(reach_error())) ) 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 -> 0bca5bbd8ac33ab1d58a01dd560e5e3d6c95b5dc081f89e35a635c59fa2143ad [2021-10-28 09:04:30,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:04:30,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:04:30,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:04:30,997 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:04:30,999 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:04:31,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-10-28 09:04:31,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/data/bf11cb5e8/289d347b464445b89f0066c90c982431/FLAG6f2c6661f [2021-10-28 09:04:31,717 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:04:31,725 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-10-28 09:04:31,748 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/data/bf11cb5e8/289d347b464445b89f0066c90c982431/FLAG6f2c6661f [2021-10-28 09:04:32,034 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/data/bf11cb5e8/289d347b464445b89f0066c90c982431 [2021-10-28 09:04:32,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:04:32,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:04:32,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:04:32,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:04:32,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:04:32,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5285304f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32, skipping insertion in model container [2021-10-28 09:04:32,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:04:32,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:04:32,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/sv-benchmarks/c/systemc/transmitter.01.cil.c[401,414] [2021-10-28 09:04:32,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:04:32,418 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:04:32,436 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/sv-benchmarks/c/systemc/transmitter.01.cil.c[401,414] [2021-10-28 09:04:32,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:04:32,511 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:04:32,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32 WrapperNode [2021-10-28 09:04:32,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:04:32,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:04:32,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:04:32,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:04:32,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:04:32,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:04:32,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:04:32,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:04:32,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:04:32,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:04:32,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:04:32,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:04:32,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (1/1) ... [2021-10-28 09:04:32,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:04:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:04:32,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:04:32,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:04:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:04:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:04:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:04:32,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:04:33,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:04:33,511 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-10-28 09:04:33,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:04:33 BoogieIcfgContainer [2021-10-28 09:04:33,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:04:33,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:04:33,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:04:33,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:04:33,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:04:32" (1/3) ... [2021-10-28 09:04:33,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f67602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:04:33, skipping insertion in model container [2021-10-28 09:04:33,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:32" (2/3) ... [2021-10-28 09:04:33,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f67602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:04:33, skipping insertion in model container [2021-10-28 09:04:33,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:04:33" (3/3) ... [2021-10-28 09:04:33,530 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2021-10-28 09:04:33,544 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:04:33,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 09:04:33,652 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:04:33,669 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:04:33,670 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 09:04:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 120 states have (on average 1.5833333333333333) internal successors, (190), 121 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:33,733 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:33,733 INFO L513 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] [2021-10-28 09:04:33,734 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2021-10-28 09:04:33,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:33,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209119671] [2021-10-28 09:04:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:33,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:33,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:33,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209119671] [2021-10-28 09:04:33,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209119671] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:33,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:33,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:33,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216383751] [2021-10-28 09:04:33,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:33,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:34,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:34,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,011 INFO L87 Difference]: Start difference. First operand has 122 states, 120 states have (on average 1.5833333333333333) internal successors, (190), 121 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:34,151 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2021-10-28 09:04:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:34,185 INFO L225 Difference]: With dead ends: 239 [2021-10-28 09:04:34,186 INFO L226 Difference]: Without dead ends: 118 [2021-10-28 09:04:34,192 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-28 09:04:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-10-28 09:04:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4871794871794872) internal successors, (174), 117 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2021-10-28 09:04:34,254 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2021-10-28 09:04:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:34,260 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2021-10-28 09:04:34,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2021-10-28 09:04:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:34,264 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:34,265 INFO L513 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] [2021-10-28 09:04:34,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:04:34,265 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2021-10-28 09:04:34,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:34,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923570216] [2021-10-28 09:04:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:34,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:34,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:34,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923570216] [2021-10-28 09:04:34,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923570216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:34,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:34,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:04:34,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878961354] [2021-10-28 09:04:34,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:34,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,397 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:34,522 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2021-10-28 09:04:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:34,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:34,527 INFO L225 Difference]: With dead ends: 308 [2021-10-28 09:04:34,527 INFO L226 Difference]: Without dead ends: 196 [2021-10-28 09:04:34,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-10-28 09:04:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2021-10-28 09:04:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.450777202072539) internal successors, (280), 193 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2021-10-28 09:04:34,604 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2021-10-28 09:04:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:34,604 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2021-10-28 09:04:34,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2021-10-28 09:04:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:34,614 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:34,615 INFO L513 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] [2021-10-28 09:04:34,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:04:34,617 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2021-10-28 09:04:34,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:34,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896157300] [2021-10-28 09:04:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:34,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:34,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:34,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896157300] [2021-10-28 09:04:34,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896157300] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:34,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:34,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:04:34,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256286664] [2021-10-28 09:04:34,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:34,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:34,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:34,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,714 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:34,774 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2021-10-28 09:04:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:34,779 INFO L225 Difference]: With dead ends: 381 [2021-10-28 09:04:34,779 INFO L226 Difference]: Without dead ends: 194 [2021-10-28 09:04:34,782 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-28 09:04:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-10-28 09:04:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 193 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2021-10-28 09:04:34,837 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2021-10-28 09:04:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:34,838 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2021-10-28 09:04:34,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2021-10-28 09:04:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:34,843 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:34,843 INFO L513 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] [2021-10-28 09:04:34,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:04:34,844 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2021-10-28 09:04:34,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:34,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170055004] [2021-10-28 09:04:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:34,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:34,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:34,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170055004] [2021-10-28 09:04:34,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170055004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:34,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:34,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:04:34,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252322914] [2021-10-28 09:04:34,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:34,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:34,955 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:35,050 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2021-10-28 09:04:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:35,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:35,058 INFO L225 Difference]: With dead ends: 380 [2021-10-28 09:04:35,061 INFO L226 Difference]: Without dead ends: 194 [2021-10-28 09:04:35,064 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-28 09:04:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-10-28 09:04:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.3471502590673574) internal successors, (260), 193 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2021-10-28 09:04:35,101 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2021-10-28 09:04:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:35,101 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2021-10-28 09:04:35,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2021-10-28 09:04:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:35,104 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:35,104 INFO L513 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] [2021-10-28 09:04:35,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:04:35,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2021-10-28 09:04:35,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:35,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724873349] [2021-10-28 09:04:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:35,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:35,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:35,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724873349] [2021-10-28 09:04:35,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724873349] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:35,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:35,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:04:35,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584038706] [2021-10-28 09:04:35,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:04:35,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:04:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:04:35,218 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:35,388 INFO L93 Difference]: Finished difference Result 628 states and 846 transitions. [2021-10-28 09:04:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:04:35,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:35,394 INFO L225 Difference]: With dead ends: 628 [2021-10-28 09:04:35,394 INFO L226 Difference]: Without dead ends: 449 [2021-10-28 09:04:35,397 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-10-28 09:04:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 203. [2021-10-28 09:04:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.316831683168317) internal successors, (266), 202 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 266 transitions. [2021-10-28 09:04:35,482 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 266 transitions. Word has length 37 [2021-10-28 09:04:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:35,483 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 266 transitions. [2021-10-28 09:04:35,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2021-10-28 09:04:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:35,489 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:35,489 INFO L513 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] [2021-10-28 09:04:35,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:04:35,490 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:35,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2056966386, now seen corresponding path program 1 times [2021-10-28 09:04:35,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:35,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155395910] [2021-10-28 09:04:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:35,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:35,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:35,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155395910] [2021-10-28 09:04:35,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155395910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:35,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:35,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:04:35,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435103966] [2021-10-28 09:04:35,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:04:35,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:04:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:04:35,619 INFO L87 Difference]: Start difference. First operand 203 states and 266 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:35,760 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2021-10-28 09:04:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:04:35,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:35,776 INFO L225 Difference]: With dead ends: 540 [2021-10-28 09:04:35,777 INFO L226 Difference]: Without dead ends: 359 [2021-10-28 09:04:35,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-10-28 09:04:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 209. [2021-10-28 09:04:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2884615384615385) internal successors, (268), 208 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2021-10-28 09:04:35,831 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 37 [2021-10-28 09:04:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:35,835 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2021-10-28 09:04:35,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2021-10-28 09:04:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:35,849 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:35,849 INFO L513 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] [2021-10-28 09:04:35,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:04:35,851 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 62821680, now seen corresponding path program 1 times [2021-10-28 09:04:35,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:35,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461060352] [2021-10-28 09:04:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:35,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:35,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:35,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461060352] [2021-10-28 09:04:35,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461060352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:35,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:35,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:35,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991843093] [2021-10-28 09:04:35,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:35,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:35,938 INFO L87 Difference]: Start difference. First operand 209 states and 268 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:36,031 INFO L93 Difference]: Finished difference Result 554 states and 708 transitions. [2021-10-28 09:04:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 09:04:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:36,036 INFO L225 Difference]: With dead ends: 554 [2021-10-28 09:04:36,037 INFO L226 Difference]: Without dead ends: 370 [2021-10-28 09:04:36,038 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-10-28 09:04:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 355. [2021-10-28 09:04:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.2514124293785311) internal successors, (443), 354 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 443 transitions. [2021-10-28 09:04:36,091 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 443 transitions. Word has length 37 [2021-10-28 09:04:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:36,091 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 443 transitions. [2021-10-28 09:04:36,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 443 transitions. [2021-10-28 09:04:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 09:04:36,099 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:36,099 INFO L513 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] [2021-10-28 09:04:36,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:04:36,100 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1851829351, now seen corresponding path program 1 times [2021-10-28 09:04:36,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:36,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705414779] [2021-10-28 09:04:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:36,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:36,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:36,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705414779] [2021-10-28 09:04:36,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705414779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:36,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:36,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:04:36,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456158253] [2021-10-28 09:04:36,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:36,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:36,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:36,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:36,157 INFO L87 Difference]: Start difference. First operand 355 states and 443 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:36,268 INFO L93 Difference]: Finished difference Result 967 states and 1214 transitions. [2021-10-28 09:04:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:36,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-28 09:04:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:36,274 INFO L225 Difference]: With dead ends: 967 [2021-10-28 09:04:36,274 INFO L226 Difference]: Without dead ends: 642 [2021-10-28 09:04:36,276 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-28 09:04:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 634. [2021-10-28 09:04:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.2385466034755135) internal successors, (784), 633 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 784 transitions. [2021-10-28 09:04:36,359 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 784 transitions. Word has length 38 [2021-10-28 09:04:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:36,362 INFO L470 AbstractCegarLoop]: Abstraction has 634 states and 784 transitions. [2021-10-28 09:04:36,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 784 transitions. [2021-10-28 09:04:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:04:36,364 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:36,364 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-10-28 09:04:36,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:04:36,365 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1992530247, now seen corresponding path program 1 times [2021-10-28 09:04:36,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:36,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470787704] [2021-10-28 09:04:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:36,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:36,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:36,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470787704] [2021-10-28 09:04:36,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470787704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:36,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:36,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:36,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975038899] [2021-10-28 09:04:36,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:36,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:36,472 INFO L87 Difference]: Start difference. First operand 634 states and 784 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:36,636 INFO L93 Difference]: Finished difference Result 1230 states and 1535 transitions. [2021-10-28 09:04:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:36,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-28 09:04:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:36,645 INFO L225 Difference]: With dead ends: 1230 [2021-10-28 09:04:36,645 INFO L226 Difference]: Without dead ends: 921 [2021-10-28 09:04:36,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-10-28 09:04:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2021-10-28 09:04:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2315217391304347) internal successors, (1133), 920 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2021-10-28 09:04:36,770 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 51 [2021-10-28 09:04:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:36,771 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2021-10-28 09:04:36,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:04:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2021-10-28 09:04:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-28 09:04:36,774 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:36,774 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-10-28 09:04:36,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:04:36,774 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:04:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2021-10-28 09:04:36,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:36,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272858779] [2021-10-28 09:04:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:36,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:04:36,828 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:04:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:04:36,948 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:04:36,949 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:04:36,952 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:36,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:04:36,961 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:04:36,966 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:04:37,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:04:37 BoogieIcfgContainer [2021-10-28 09:04:37,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:04:37,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:04:37,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:04:37,121 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:04:37,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:04:33" (3/4) ... [2021-10-28 09:04:37,124 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:04:37,304 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:04:37,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:04:37,306 INFO L168 Benchmark]: Toolchain (without parser) took 5264.93 ms. Allocated memory was 77.6 MB in the beginning and 125.8 MB in the end (delta: 48.2 MB). Free memory was 42.8 MB in the beginning and 46.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 45.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,307 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 77.6 MB. Free memory was 59.5 MB in the beginning and 59.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:04:37,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.36 ms. Allocated memory was 77.6 MB in the beginning and 104.9 MB in the end (delta: 27.3 MB). Free memory was 42.6 MB in the beginning and 80.8 MB in the end (delta: -38.2 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.96 ms. Allocated memory is still 104.9 MB. Free memory was 80.8 MB in the beginning and 78.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,309 INFO L168 Benchmark]: Boogie Preprocessor took 45.36 ms. Allocated memory is still 104.9 MB. Free memory was 78.4 MB in the beginning and 76.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,309 INFO L168 Benchmark]: RCFGBuilder took 852.64 ms. Allocated memory is still 104.9 MB. Free memory was 76.7 MB in the beginning and 58.8 MB in the end (delta: 17.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,310 INFO L168 Benchmark]: TraceAbstraction took 3601.33 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 58.4 MB in the beginning and 54.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,311 INFO L168 Benchmark]: Witness Printer took 183.92 ms. Allocated memory is still 125.8 MB. Free memory was 54.6 MB in the beginning and 46.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:37,314 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.39 ms. Allocated memory is still 77.6 MB. Free memory was 59.5 MB in the beginning and 59.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 464.36 ms. Allocated memory was 77.6 MB in the beginning and 104.9 MB in the end (delta: 27.3 MB). Free memory was 42.6 MB in the beginning and 80.8 MB in the end (delta: -38.2 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.96 ms. Allocated memory is still 104.9 MB. Free memory was 80.8 MB in the beginning and 78.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.36 ms. Allocated memory is still 104.9 MB. Free memory was 78.4 MB in the beginning and 76.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 852.64 ms. Allocated memory is still 104.9 MB. Free memory was 76.7 MB in the beginning and 58.8 MB in the end (delta: 17.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3601.33 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 58.4 MB in the beginning and 54.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. * Witness Printer took 183.92 ms. Allocated memory is still 125.8 MB. Free memory was 54.6 MB in the beginning and 46.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L441] int __retres1 ; [L356] m_i = 1 [L357] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L382] int kernel_st ; [L383] int tmp ; [L384] int tmp___0 ; [L388] kernel_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L153] COND TRUE m_i == 1 [L154] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L158] COND TRUE t1_i == 1 [L159] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L242] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L247] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L252] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L107] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L119] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L123] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L126] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L138] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] tmp___0 = is_transmit1_triggered() [L300] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L265] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L270] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L275] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L396] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] kernel_st = 1 [L189] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L193] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L168] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L184] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L74] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L87] t1_pc = 1 [L88] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L193] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L168] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L184] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND TRUE \read(tmp_ndt_1) [L208] m_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L33] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L44] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L47] E_1 = 1 [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L107] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L119] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L123] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L126] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] COND TRUE E_1 == 1 [L128] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L138] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] tmp___0 = is_transmit1_triggered() [L300] COND TRUE \read(tmp___0) [L301] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L49] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L54] m_pc = 1 [L55] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L74] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L77] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L13] reach_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1538 SDtfs, 1683 SDslu, 1462 SDs, 0 SdLazy, 159 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=9, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 421 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11/11 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 incorrect! [2021-10-28 09:04:37,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad309ab-e832-4bd7-83b1-3b1732c890f0/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...