./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:18:57,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:18:57,125 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:18:57,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:18:57,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:18:57,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:18:57,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:18:57,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:18:57,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:18:57,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:18:57,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:18:57,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:18:57,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:18:57,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:18:57,163 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:18:57,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:18:57,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:18:57,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:18:57,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:18:57,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:18:57,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:18:57,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:18:57,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:18:57,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:18:57,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:18:57,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:18:57,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:18:57,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:18:57,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:18:57,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:18:57,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:18:57,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:18:57,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:57,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:18:57,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:18:57,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:18:57,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:18:57,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:18:57,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:18:57,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:18:57,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:18:57,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:18:57,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/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_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-10-31 22:18:57,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:18:57,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:18:57,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:18:57,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:18:57,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:18:57,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i Unable to find full path for "g++" [2024-10-31 22:18:59,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:18:59,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:18:59,947 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-31 22:18:59,962 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data/bbb9a52dc/c0919a16b4474c4fbb4e747b809b6f0b/FLAG1c0ec3c27 [2024-10-31 22:18:59,983 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data/bbb9a52dc/c0919a16b4474c4fbb4e747b809b6f0b [2024-10-31 22:18:59,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:18:59,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:18:59,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:59,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:00,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:00,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:59" (1/1) ... [2024-10-31 22:19:00,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65adcf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00, skipping insertion in model container [2024-10-31 22:19:00,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:59" (1/1) ... [2024-10-31 22:19:00,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:00,256 WARN L251 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_d668af5a-8b40-433f-8f8d-96f2de578f54/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-31 22:19:00,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:00,320 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:00,333 WARN L251 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_d668af5a-8b40-433f-8f8d-96f2de578f54/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-31 22:19:00,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:00,387 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:00,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00 WrapperNode [2024-10-31 22:19:00,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:00,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:00,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:00,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:00,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,491 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-10-31 22:19:00,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:00,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:00,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:00,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:00,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,547 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:19:00,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:00,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:00,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:00,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:00,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (1/1) ... [2024-10-31 22:19:00,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:00,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:00,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:00,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:00,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:19:00,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:19:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:19:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:00,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:00,857 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:00,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:01,239 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-31 22:19:01,239 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:01,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:01,268 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:19:01,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:01 BoogieIcfgContainer [2024-10-31 22:19:01,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:01,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:01,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:01,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:01,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:18:59" (1/3) ... [2024-10-31 22:19:01,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1646f74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:01, skipping insertion in model container [2024-10-31 22:19:01,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:00" (2/3) ... [2024-10-31 22:19:01,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1646f74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:01, skipping insertion in model container [2024-10-31 22:19:01,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:01" (3/3) ... [2024-10-31 22:19:01,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-31 22:19:01,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:01,305 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:19:01,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:01,380 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@151bc239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:01,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:19:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:01,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:01,398 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:01,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:01,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1153718418, now seen corresponding path program 1 times [2024-10-31 22:19:01,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764763201] [2024-10-31 22:19:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-31 22:19:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764763201] [2024-10-31 22:19:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764763201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:01,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217361022] [2024-10-31 22:19:01,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:01,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:19:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:01,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:19:01,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:01,870 INFO L87 Difference]: Start difference. First operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-31 22:19:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:01,904 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions. [2024-10-31 22:19:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:19:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-10-31 22:19:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:01,915 INFO L225 Difference]: With dead ends: 117 [2024-10-31 22:19:01,915 INFO L226 Difference]: Without dead ends: 56 [2024-10-31 22:19:01,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:01,925 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:01,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-31 22:19:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-31 22:19:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-10-31 22:19:01,975 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 90 [2024-10-31 22:19:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:01,976 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-10-31 22:19:01,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-31 22:19:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-10-31 22:19:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:01,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:01,981 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:01,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:01,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 895368340, now seen corresponding path program 1 times [2024-10-31 22:19:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312048041] [2024-10-31 22:19:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-31 22:19:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:04,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312048041] [2024-10-31 22:19:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312048041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:19:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641176446] [2024-10-31 22:19:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:04,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:19:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:19:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:19:04,027 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:04,955 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2024-10-31 22:19:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:19:04,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-31 22:19:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:04,959 INFO L225 Difference]: With dead ends: 198 [2024-10-31 22:19:04,959 INFO L226 Difference]: Without dead ends: 145 [2024-10-31 22:19:04,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:04,961 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 254 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:04,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 232 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:19:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-31 22:19:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 62. [2024-10-31 22:19:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-10-31 22:19:04,973 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 90 [2024-10-31 22:19:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:04,975 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-10-31 22:19:04,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-10-31 22:19:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:04,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:04,978 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:04,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:04,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:04,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -879639022, now seen corresponding path program 1 times [2024-10-31 22:19:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5763079] [2024-10-31 22:19:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-31 22:19:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5763079] [2024-10-31 22:19:06,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5763079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961153902] [2024-10-31 22:19:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:06,825 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:07,239 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2024-10-31 22:19:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:19:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-31 22:19:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:07,242 INFO L225 Difference]: With dead ends: 149 [2024-10-31 22:19:07,242 INFO L226 Difference]: Without dead ends: 90 [2024-10-31 22:19:07,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:07,244 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:07,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:19:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-31 22:19:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2024-10-31 22:19:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-10-31 22:19:07,260 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 90 [2024-10-31 22:19:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-10-31 22:19:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-10-31 22:19:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:19:07,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:07,263 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:07,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:07,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 308562326, now seen corresponding path program 1 times [2024-10-31 22:19:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264816681] [2024-10-31 22:19:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-31 22:19:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264816681] [2024-10-31 22:19:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264816681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:07,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:07,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843791071] [2024-10-31 22:19:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:07,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:07,501 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:07,554 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2024-10-31 22:19:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-31 22:19:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:07,561 INFO L225 Difference]: With dead ends: 157 [2024-10-31 22:19:07,561 INFO L226 Difference]: Without dead ends: 88 [2024-10-31 22:19:07,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:07,563 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 31 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:07,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-31 22:19:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2024-10-31 22:19:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2024-10-31 22:19:07,578 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 90 [2024-10-31 22:19:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2024-10-31 22:19:07,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2024-10-31 22:19:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-31 22:19:07,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:07,580 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:07,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:07,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:07,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash -69887406, now seen corresponding path program 1 times [2024-10-31 22:19:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60712727] [2024-10-31 22:19:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-31 22:19:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60712727] [2024-10-31 22:19:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60712727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:19:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67654775] [2024-10-31 22:19:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:19:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:08,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:19:08,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:19:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-31 22:19:08,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:19:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-31 22:19:08,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:19:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-31 22:19:09,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67654775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:19:09,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:19:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21 [2024-10-31 22:19:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731574816] [2024-10-31 22:19:09,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:19:09,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-31 22:19:09,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-31 22:19:09,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-31 22:19:09,349 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-10-31 22:19:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:09,955 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-10-31 22:19:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 22:19:09,957 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 93 [2024-10-31 22:19:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:09,958 INFO L225 Difference]: With dead ends: 179 [2024-10-31 22:19:09,958 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:19:09,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2024-10-31 22:19:09,960 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 209 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:09,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 392 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:19:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:19:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-10-31 22:19:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:19:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-10-31 22:19:09,973 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 93 [2024-10-31 22:19:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:09,973 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-10-31 22:19:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-10-31 22:19:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-10-31 22:19:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-31 22:19:09,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:09,976 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:09,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:19:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:19:10,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 238150162, now seen corresponding path program 1 times [2024-10-31 22:19:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659147003] [2024-10-31 22:19:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-31 22:19:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659147003] [2024-10-31 22:19:11,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659147003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:11,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:11,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:19:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96262713] [2024-10-31 22:19:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:11,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:19:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:19:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:19:11,095 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:11,824 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2024-10-31 22:19:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:19:11,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-31 22:19:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:11,830 INFO L225 Difference]: With dead ends: 189 [2024-10-31 22:19:11,830 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:19:11,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:19:11,833 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:11,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 495 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:19:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:19:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-10-31 22:19:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:19:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2024-10-31 22:19:11,863 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 93 [2024-10-31 22:19:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:11,864 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2024-10-31 22:19:11,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2024-10-31 22:19:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-31 22:19:11,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:11,866 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:11,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:11,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash 631177172, now seen corresponding path program 1 times [2024-10-31 22:19:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:11,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695408793] [2024-10-31 22:19:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:19:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:19:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:19:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:19:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:19:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:19:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:19:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:19:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:19:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:19:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:19:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:19:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:19:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-31 22:19:12,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695408793] [2024-10-31 22:19:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695408793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:12,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:19:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745572796] [2024-10-31 22:19:12,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:12,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:19:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:19:12,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:19:12,661 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:13,209 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2024-10-31 22:19:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:19:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-31 22:19:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:13,211 INFO L225 Difference]: With dead ends: 120 [2024-10-31 22:19:13,211 INFO L226 Difference]: Without dead ends: 118 [2024-10-31 22:19:13,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:19:13,212 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:13,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 460 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:19:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-31 22:19:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-10-31 22:19:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 87 states have internal predecessors, (109), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:19:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2024-10-31 22:19:13,225 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 93 [2024-10-31 22:19:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:13,226 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2024-10-31 22:19:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-31 22:19:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2024-10-31 22:19:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-31 22:19:13,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:13,227 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:13,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:13,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash -204748978, now seen corresponding path program 1 times [2024-10-31 22:19:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200789985] [2024-10-31 22:19:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:13,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:19:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:13,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:19:13,330 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:19:13,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:19:13,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:13,339 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:13,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:19:13,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:19:13 BoogieIcfgContainer [2024-10-31 22:19:13,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:19:13,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:19:13,440 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:19:13,440 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:19:13,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:01" (3/4) ... [2024-10-31 22:19:13,444 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:19:13,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:19:13,446 INFO L158 Benchmark]: Toolchain (without parser) took 13459.26ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 106.4MB in the beginning and 114.5MB in the end (delta: -8.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-10-31 22:19:13,446 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:19:13,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.38ms. Allocated memory is still 138.4MB. Free memory was 106.4MB in the beginning and 91.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:19:13,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.58ms. Allocated memory is still 138.4MB. Free memory was 91.8MB in the beginning and 88.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:19:13,447 INFO L158 Benchmark]: Boogie Preprocessor took 115.10ms. Allocated memory is still 138.4MB. Free memory was 88.6MB in the beginning and 85.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:19:13,448 INFO L158 Benchmark]: RCFGBuilder took 659.75ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 65.6MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 22:19:13,448 INFO L158 Benchmark]: TraceAbstraction took 12166.36ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 65.1MB in the beginning and 115.6MB in the end (delta: -50.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-31 22:19:13,448 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 207.6MB. Free memory was 115.6MB in the beginning and 114.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:19:13,450 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.38ms. Allocated memory is still 138.4MB. Free memory was 106.4MB in the beginning and 91.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.58ms. Allocated memory is still 138.4MB. Free memory was 91.8MB in the beginning and 88.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.10ms. Allocated memory is still 138.4MB. Free memory was 88.6MB in the beginning and 85.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.75ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 65.6MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12166.36ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 65.1MB in the beginning and 115.6MB in the end (delta: -50.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 207.6MB. Free memory was 115.6MB in the beginning and 114.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; VAL [isInitial=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L84] COND TRUE k_loop < 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L86] RET updateVariables() [L87] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L87] RET step() [L88] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 766 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 2100 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1594 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 506 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 4061 SizeOfPredicates, 7 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2718/2808 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 could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:19:13,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:15,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:16,080 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:19:16,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:16,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:16,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:16,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:16,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:16,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:16,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:16,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:16,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:16,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:16,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:16,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:16,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:16,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:16,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:16,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:16,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:16,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:16,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:16,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:16,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:19:16,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:19:16,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:16,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:19:16,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:16,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:16,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:16,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:16,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:16,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:19:16,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:16,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:16,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:16,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:16,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:16,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:19:16,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:19:16,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:16,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:16,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:16,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:16,158 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:19:16,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/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_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-10-31 22:19:16,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:16,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:16,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:16,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:16,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:16,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i Unable to find full path for "g++" [2024-10-31 22:19:18,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:19,109 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:19,111 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-31 22:19:19,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data/e2d9425ec/7ed8e2a090ba456cb53258adc7c97d64/FLAG897a00cfb [2024-10-31 22:19:19,136 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/data/e2d9425ec/7ed8e2a090ba456cb53258adc7c97d64 [2024-10-31 22:19:19,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:19,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:19,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:19,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:19,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:19,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40465f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19, skipping insertion in model container [2024-10-31 22:19:19,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:19,453 WARN L251 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_d668af5a-8b40-433f-8f8d-96f2de578f54/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-31 22:19:19,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:19,545 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:19,561 WARN L251 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_d668af5a-8b40-433f-8f8d-96f2de578f54/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-31 22:19:19,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:19,628 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:19,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19 WrapperNode [2024-10-31 22:19:19,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:19,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:19,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:19,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:19,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,698 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-10-31 22:19:19,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:19,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:19,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:19,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:19,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,749 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:19:19,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:19,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:19,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:19,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:19,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:19,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:19,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:19,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:19:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:19:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:19:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:19,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:20,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:20,352 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-31 22:19:20,353 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:20,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:20,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:19:20,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:20 BoogieIcfgContainer [2024-10-31 22:19:20,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:20,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:20,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:20,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:20,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:19" (1/3) ... [2024-10-31 22:19:20,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b41568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:20, skipping insertion in model container [2024-10-31 22:19:20,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (2/3) ... [2024-10-31 22:19:20,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b41568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:20, skipping insertion in model container [2024-10-31 22:19:20,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:20" (3/3) ... [2024-10-31 22:19:20,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-31 22:19:20,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:20,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:19:20,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:20,482 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d12a7ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:20,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:19:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-31 22:19:20,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,498 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:20,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 231096405, now seen corresponding path program 1 times [2024-10-31 22:19:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:19:20,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527412647] [2024-10-31 22:19:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:19:20,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:19:20,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:19:20,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:19:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:19:20,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:19:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:19:20,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:19:20,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:19:20,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527412647] [2024-10-31 22:19:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527412647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290794810] [2024-10-31 22:19:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:19:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:19:20,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:19:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:20,799 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-31 22:19:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,827 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2024-10-31 22:19:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:19:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-10-31 22:19:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,840 INFO L225 Difference]: With dead ends: 87 [2024-10-31 22:19:20,840 INFO L226 Difference]: Without dead ends: 41 [2024-10-31 22:19:20,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:20,848 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-31 22:19:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-31 22:19:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-31 22:19:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-10-31 22:19:20,897 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 86 [2024-10-31 22:19:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,897 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-10-31 22:19:20,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-31 22:19:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-10-31 22:19:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-31 22:19:20,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,902 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:20,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:19:21,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:19:21,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -479824553, now seen corresponding path program 1 times [2024-10-31 22:19:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:19:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174875179] [2024-10-31 22:19:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:19:21,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:19:21,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:19:21,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d668af5a-8b40-433f-8f8d-96f2de578f54/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:19:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-31 22:19:21,333 INFO L278 TraceCheckSpWp]: Computing forward predicates...