./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:38:50,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:38:50,114 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:38:50,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:38:50,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:38:50,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:38:50,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:38:50,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:38:50,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:38:50,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:38:50,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:38:50,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:38:50,156 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:38:50,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:38:50,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:38:50,158 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:38:50,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:38:50,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:38:50,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:38:50,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:38:50,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:38:50,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:38:50,163 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:38:50,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:38:50,165 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:38:50,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:38:50,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:38:50,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:38:50,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:38:50,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:38:50,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:38:50,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:38:50,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:38:50,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:38:50,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:38:50,171 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:38:50,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:38:50,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:38:50,172 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:38:50,173 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_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 [2023-11-06 22:38:50,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:38:50,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:38:50,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:38:50,544 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:38:50,546 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:38:50,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-11-06 22:38:53,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:38:54,094 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:38:54,095 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-11-06 22:38:54,105 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data/96e58f4a6/0ec4ea3535674d2c80ac1b549ccddc9c/FLAG5a4192fa6 [2023-11-06 22:38:54,121 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data/96e58f4a6/0ec4ea3535674d2c80ac1b549ccddc9c [2023-11-06 22:38:54,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:38:54,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:38:54,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:38:54,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:38:54,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:38:54,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10221a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54, skipping insertion in model container [2023-11-06 22:38:54,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,183 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:38:54,341 WARN L240 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_57f1b955-a161-4188-9d21-ffe6afc9557b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2023-11-06 22:38:54,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:38:54,400 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:38:54,415 WARN L240 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_57f1b955-a161-4188-9d21-ffe6afc9557b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2023-11-06 22:38:54,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:38:54,469 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:38:54,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54 WrapperNode [2023-11-06 22:38:54,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:38:54,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:38:54,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:38:54,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:38:54,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,534 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-11-06 22:38:54,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:38:54,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:38:54,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:38:54,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:38:54,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:38:54,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:38:54,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:38:54,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:38:54,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (1/1) ... [2023-11-06 22:38:54,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:38:54,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:54,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:54,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:38:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:38:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:38:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:38:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:38:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:38:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:38:54,737 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:38:54,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:38:55,165 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:38:55,174 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:38:55,174 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:38:55,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:55 BoogieIcfgContainer [2023-11-06 22:38:55,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:38:55,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:38:55,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:38:55,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:38:55,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:38:54" (1/3) ... [2023-11-06 22:38:55,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a19692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:55, skipping insertion in model container [2023-11-06 22:38:55,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:54" (2/3) ... [2023-11-06 22:38:55,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a19692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:55, skipping insertion in model container [2023-11-06 22:38:55,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:55" (3/3) ... [2023-11-06 22:38:55,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-11-06 22:38:55,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:38:55,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:38:55,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:38:55,287 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57fd468d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:38:55,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:38:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:38:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:38:55,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:38:55,318 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:55,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:38:55,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -400597884, now seen corresponding path program 1 times [2023-11-06 22:38:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4302568] [2023-11-06 22:38:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:38:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:38:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:38:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:38:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:38:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:38:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:38:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:38:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:38:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:38:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:38:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:38:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:38:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:38:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:38:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:38:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:38:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:38:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4302568] [2023-11-06 22:38:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4302568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:38:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073670924] [2023-11-06 22:38:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:55,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:38:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:38:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:38:56,005 INFO L87 Difference]: Start difference. First operand has 61 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:38:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:56,069 INFO L93 Difference]: Finished difference Result 119 states and 194 transitions. [2023-11-06 22:38:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:38:56,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2023-11-06 22:38:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:38:56,082 INFO L225 Difference]: With dead ends: 119 [2023-11-06 22:38:56,083 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 22:38:56,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:38:56,092 INFO L413 NwaCegarLoop]: 87 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, 87 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 [2023-11-06 22:38:56,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:38:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 22:38:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 22:38:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:38:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-11-06 22:38:56,153 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 109 [2023-11-06 22:38:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:38:56,154 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-11-06 22:38:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:38:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-11-06 22:38:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:38:56,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:38:56,159 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:56,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:38:56,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:38:56,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash -834138174, now seen corresponding path program 1 times [2023-11-06 22:38:56,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:56,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076718990] [2023-11-06 22:38:56,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:38:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:38:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:38:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:38:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:38:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:38:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:38:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:38:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:38:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:38:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:38:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:38:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:38:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:38:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:38:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:38:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:38:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:38:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076718990] [2023-11-06 22:38:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076718990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:38:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945924238] [2023-11-06 22:38:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:57,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:38:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:38:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:38:57,238 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:38:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:58,478 INFO L93 Difference]: Finished difference Result 197 states and 291 transitions. [2023-11-06 22:38:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:38:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:38:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:38:58,489 INFO L225 Difference]: With dead ends: 197 [2023-11-06 22:38:58,489 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 22:38:58,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:38:58,500 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 206 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:38:58,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 283 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:38:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 22:38:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 58. [2023-11-06 22:38:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:38:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2023-11-06 22:38:58,558 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 109 [2023-11-06 22:38:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:38:58,564 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2023-11-06 22:38:58,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:38:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2023-11-06 22:38:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-06 22:38:58,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:38:58,570 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:38:58,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:38:58,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1858082547, now seen corresponding path program 1 times [2023-11-06 22:38:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:58,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77897697] [2023-11-06 22:38:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:58,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:59,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:59,038 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:38:59,040 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:38:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:38:59,046 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:38:59,051 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:38:59,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:38:59 BoogieIcfgContainer [2023-11-06 22:38:59,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:38:59,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:38:59,208 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:38:59,208 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:38:59,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:55" (3/4) ... [2023-11-06 22:38:59,212 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:38:59,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:38:59,214 INFO L158 Benchmark]: Toolchain (without parser) took 5087.54ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 90.3MB in the beginning and 97.4MB in the end (delta: -7.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2023-11-06 22:38:59,214 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 136.3MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:38:59,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.31ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 77.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:38:59,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.71ms. Allocated memory is still 136.3MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:38:59,216 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 136.3MB. Free memory was 75.6MB in the beginning and 74.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:38:59,217 INFO L158 Benchmark]: RCFGBuilder took 602.38ms. Allocated memory is still 136.3MB. Free memory was 74.1MB in the beginning and 58.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:38:59,217 INFO L158 Benchmark]: TraceAbstraction took 4023.52ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 57.3MB in the beginning and 97.4MB in the end (delta: -40.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2023-11-06 22:38:59,218 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 180.4MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:38:59,224 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.34ms. Allocated memory is still 136.3MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.31ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 77.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.71ms. Allocated memory is still 136.3MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 136.3MB. Free memory was 75.6MB in the beginning and 74.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 602.38ms. Allocated memory is still 136.3MB. Free memory was 74.1MB in the beginning and 58.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4023.52ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 57.3MB in the beginning and 97.4MB in the end (delta: -40.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 180.4MB. Free memory is still 97.4MB. 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 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; VAL [isInitial=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=6442450949, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=6442450949, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=6442450949, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L106] RET updateVariables() [L107] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=2147483641, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=2, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=2147483641, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=6, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L107] RET step() [L108] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [(var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=6, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [(last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))=1, (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=6, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [(last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))=1, (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=6, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=6, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=5, var_1_13=4, var_1_14=43, var_1_15=1, var_1_16=1, var_1_17=6442450949, var_1_18=6442450949, var_1_1=2, var_1_6=6, var_1_7=2147483647, var_1_8=6, var_1_9=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 208 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 85 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 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 [2023-11-06 22:38:59,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:02,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:02,505 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:39:02,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:02,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:02,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:02,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:02,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:02,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:02,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:02,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:02,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:02,571 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:02,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:02,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:39:02,579 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:02,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:02,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:02,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:39:02,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:02,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:39:02,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:39:02,583 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:39:02,583 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:39:02,584 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:02,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:39:02,585 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:02,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:02,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:02,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:02,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:02,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:02,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:02,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:39:02,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:39:02,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:39:02,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:02,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:39:02,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:02,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:02,591 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:39:02,592 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:02,592 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_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 [2023-11-06 22:39:03,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:03,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:03,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:03,081 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:03,082 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:03,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-11-06 22:39:06,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:06,988 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:06,989 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-11-06 22:39:07,004 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data/27ab41f01/b46b58c0929640c7a2f18b8ec99bc888/FLAGcb191191d [2023-11-06 22:39:07,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/data/27ab41f01/b46b58c0929640c7a2f18b8ec99bc888 [2023-11-06 22:39:07,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:07,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:07,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:07,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:07,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:07,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35edcc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07, skipping insertion in model container [2023-11-06 22:39:07,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,091 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:07,308 WARN L240 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_57f1b955-a161-4188-9d21-ffe6afc9557b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2023-11-06 22:39:07,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:07,390 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:07,402 WARN L240 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_57f1b955-a161-4188-9d21-ffe6afc9557b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2023-11-06 22:39:07,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:07,454 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:07,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07 WrapperNode [2023-11-06 22:39:07,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:07,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:07,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:07,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:07,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,538 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-11-06 22:39:07,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:07,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:07,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:07,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:07,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:07,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:07,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:07,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:07,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (1/1) ... [2023-11-06 22:39:07,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:07,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:07,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:39:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:39:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:39:07,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:39:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:07,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:07,862 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:07,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:08,290 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:08,311 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:08,312 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:39:08,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:08 BoogieIcfgContainer [2023-11-06 22:39:08,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:08,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:08,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:08,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:08,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:07" (1/3) ... [2023-11-06 22:39:08,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6167e4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:08, skipping insertion in model container [2023-11-06 22:39:08,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:07" (2/3) ... [2023-11-06 22:39:08,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6167e4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:08, skipping insertion in model container [2023-11-06 22:39:08,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:08" (3/3) ... [2023-11-06 22:39:08,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2023-11-06 22:39:08,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:08,356 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:39:08,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:08,450 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c06fe1d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:08,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:39:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:39:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:39:08,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:08,477 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:08,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:08,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1716636902, now seen corresponding path program 1 times [2023-11-06 22:39:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204374124] [2023-11-06 22:39:08,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:08,511 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 [2023-11-06 22:39:08,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:08,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:39:08,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:39:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:08,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:39:08,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-06 22:39:08,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:08,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:08,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204374124] [2023-11-06 22:39:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204374124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:08,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:08,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84511456] [2023-11-06 22:39:08,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:08,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:39:08,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:39:08,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:08,946 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:39:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:08,985 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2023-11-06 22:39:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:39:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2023-11-06 22:39:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:08,998 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:39:08,998 INFO L226 Difference]: Without dead ends: 48 [2023-11-06 22:39:09,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:09,008 INFO L413 NwaCegarLoop]: 73 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, 73 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 [2023-11-06 22:39:09,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-06 22:39:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-06 22:39:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:39:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2023-11-06 22:39:09,067 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 107 [2023-11-06 22:39:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:09,068 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2023-11-06 22:39:09,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:39:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2023-11-06 22:39:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:39:09,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:09,074 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:09,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:09,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:39:09,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:09,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1863698524, now seen corresponding path program 1 times [2023-11-06 22:39:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:09,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17082136] [2023-11-06 22:39:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:09,289 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 [2023-11-06 22:39:09,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:09,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:39:09,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:39:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:09,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:39:09,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:24,275 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:39:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:39:32,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:32,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17082136] [2023-11-06 22:39:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17082136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:39:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105727320] [2023-11-06 22:39:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:32,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:39:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:39:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:39:32,770 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:39:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:48,115 INFO L93 Difference]: Finished difference Result 167 states and 237 transitions. [2023-11-06 22:39:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:39:48,116 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2023-11-06 22:39:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:48,120 INFO L225 Difference]: With dead ends: 167 [2023-11-06 22:39:48,121 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:39:48,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:39:48,123 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 184 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:48,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 662 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-11-06 22:39:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:39:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 91. [2023-11-06 22:39:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:39:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2023-11-06 22:39:48,165 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 107 [2023-11-06 22:39:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:48,166 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2023-11-06 22:39:48,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:39:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2023-11-06 22:39:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:39:48,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:48,169 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:48,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:48,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:39:48,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:48,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash -88691162, now seen corresponding path program 1 times [2023-11-06 22:39:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024454068] [2023-11-06 22:39:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:48,384 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 [2023-11-06 22:39:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:48,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:39:48,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (4)] Waiting until timeout for monitored process [2023-11-06 22:39:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:39:48,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-06 22:39:48,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:39:48,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024454068] [2023-11-06 22:39:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024454068] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:48,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-06 22:39:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258499789] [2023-11-06 22:39:48,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:48,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:39:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:48,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:39:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:39:48,899 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 22:39:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:49,650 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2023-11-06 22:39:49,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:39:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 107 [2023-11-06 22:39:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:49,654 INFO L225 Difference]: With dead ends: 152 [2023-11-06 22:39:49,654 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:39:49,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:39:49,657 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 131 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:49,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 176 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:39:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:39:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2023-11-06 22:39:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:39:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2023-11-06 22:39:49,694 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 107 [2023-11-06 22:39:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:49,697 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2023-11-06 22:39:49,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 22:39:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2023-11-06 22:39:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:39:49,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:49,708 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:49,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:49,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:39:49,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:49,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1949399734, now seen corresponding path program 1 times [2023-11-06 22:39:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:49,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335937899] [2023-11-06 22:39:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:49,925 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 [2023-11-06 22:39:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:49,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:39:49,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (5)] Waiting until timeout for monitored process [2023-11-06 22:39:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:39:50,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:57,389 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:40:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 22:40:07,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:40:20,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:20,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335937899] [2023-11-06 22:40:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335937899] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:40:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:40:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-11-06 22:40:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530185709] [2023-11-06 22:40:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:20,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:40:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:40:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:40:20,422 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:40:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:29,942 INFO L93 Difference]: Finished difference Result 156 states and 206 transitions. [2023-11-06 22:40:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:40:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2023-11-06 22:40:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:40:29,946 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:40:29,947 INFO L226 Difference]: Without dead ends: 154 [2023-11-06 22:40:29,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:40:29,949 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 176 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:40:29,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 447 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-06 22:40:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-06 22:40:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2023-11-06 22:40:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:40:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2023-11-06 22:40:29,983 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 108 [2023-11-06 22:40:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:40:29,984 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions. [2023-11-06 22:40:29,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:40:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2023-11-06 22:40:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:40:29,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:29,987 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:30,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (5)] Ended with exit code 0 [2023-11-06 22:40:30,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:40:30,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:40:30,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:30,202 INFO L85 PathProgramCache]: Analyzing trace with hash 65365787, now seen corresponding path program 1 times [2023-11-06 22:40:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996428327] [2023-11-06 22:40:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:30,204 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 [2023-11-06 22:40:30,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:30,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:40:30,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (6)] Waiting until timeout for monitored process [2023-11-06 22:40:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:30,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:40:30,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 22:40:46,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:41:03,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996428327] [2023-11-06 22:41:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996428327] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:41:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-11-06 22:41:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529513464] [2023-11-06 22:41:03,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:03,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:41:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:03,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:41:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:41:03,421 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:41:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:23,289 INFO L93 Difference]: Finished difference Result 160 states and 210 transitions. [2023-11-06 22:41:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:41:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:41:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:23,297 INFO L225 Difference]: With dead ends: 160 [2023-11-06 22:41:23,298 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 22:41:23,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=341, Invalid=1299, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 22:41:23,300 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 198 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:23,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 328 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-06 22:41:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 22:41:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2023-11-06 22:41:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:41:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2023-11-06 22:41:23,340 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 109 [2023-11-06 22:41:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:23,341 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2023-11-06 22:41:23,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:41:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2023-11-06 22:41:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:41:23,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:23,343 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:23,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:23,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:41:23,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:41:23,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 63518745, now seen corresponding path program 1 times [2023-11-06 22:41:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:23,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441050690] [2023-11-06 22:41:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:23,559 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 [2023-11-06 22:41:23,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:23,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:41:23,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (7)] Waiting until timeout for monitored process [2023-11-06 22:41:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:23,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:41:23,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 22:41:43,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:41:58,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441050690] [2023-11-06 22:41:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441050690] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:58,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:41:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2023-11-06 22:41:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790359671] [2023-11-06 22:41:58,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:58,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:41:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:58,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:41:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:41:58,129 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:42:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:40,574 INFO L93 Difference]: Finished difference Result 147 states and 194 transitions. [2023-11-06 22:42:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:42:40,577 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:42:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:40,578 INFO L225 Difference]: With dead ends: 147 [2023-11-06 22:42:40,578 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:42:40,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=427, Invalid=1643, Unknown=0, NotChecked=0, Total=2070 [2023-11-06 22:42:40,582 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 119 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:40,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 347 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2023-11-06 22:42:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:42:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:42:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:42:40,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2023-11-06 22:42:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:40,584 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:42:40,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:42:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:42:40,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:42:40,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:42:40,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 (7)] Ended with exit code 0 [2023-11-06 22:42:40,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57f1b955-a161-4188-9d21-ffe6afc9557b/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:42:40,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:42:46,827 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 189 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)