./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:05,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:06,110 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:44:06,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:06,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:06,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:06,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:06,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:06,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:06,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:06,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:44:06,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:44:06,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:06,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:06,168 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:06,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:06,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:44:06,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:06,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:44:06,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:06,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:44:06,172 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c [2024-11-13 12:44:06,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:06,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:06,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:06,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:06,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:06,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i Unable to find full path for "g++" [2024-11-13 12:44:08,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:08,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:08,900 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-13 12:44:08,914 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data/1360bacac/f43514ffb9fe4c09b71a7d43ce5dc6b8/FLAG3f055e33b [2024-11-13 12:44:08,936 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data/1360bacac/f43514ffb9fe4c09b71a7d43ce5dc6b8 [2024-11-13 12:44:08,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:08,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:08,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:08,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:08,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:08,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:08" (1/1) ... [2024-11-13 12:44:08,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f82b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:08, skipping insertion in model container [2024-11-13 12:44:08,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:08" (1/1) ... [2024-11-13 12:44:08,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:09,171 WARN L250 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_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-13 12:44:09,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:09,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:09,319 WARN L250 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_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-13 12:44:09,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:09,373 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:09,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09 WrapperNode [2024-11-13 12:44:09,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:09,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:09,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:09,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:09,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,469 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-13 12:44:09,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:09,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:09,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:09,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:09,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:44:09,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:09,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:09,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:09,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:09,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (1/1) ... [2024-11-13 12:44:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:09,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:09,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:44:09,619 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:09,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:09,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:09,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:10,202 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:10,202 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:10,221 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:10,223 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:44:10,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:10 BoogieIcfgContainer [2024-11-13 12:44:10,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:10,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:44:10,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:44:10,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:44:10,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:44:08" (1/3) ... [2024-11-13 12:44:10,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f6905f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:10, skipping insertion in model container [2024-11-13 12:44:10,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:09" (2/3) ... [2024-11-13 12:44:10,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f6905f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:10, skipping insertion in model container [2024-11-13 12:44:10,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:10" (3/3) ... [2024-11-13 12:44:10,238 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-13 12:44:10,256 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:44:10,258 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:44:10,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:44:10,360 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63ac0021, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:44:10,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:44:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 12:44:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 12:44:10,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:10,422 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:10,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:10,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -322481224, now seen corresponding path program 1 times [2024-11-13 12:44:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:10,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810143855] [2024-11-13 12:44:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:10,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810143855] [2024-11-13 12:44:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810143855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:11,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336208746] [2024-11-13 12:44:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:11,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:11,939 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:12,118 INFO L93 Difference]: Finished difference Result 256 states and 463 transitions. [2024-11-13 12:44:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-13 12:44:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:12,134 INFO L225 Difference]: With dead ends: 256 [2024-11-13 12:44:12,134 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 12:44:12,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:12,142 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:12,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 12:44:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-11-13 12:44:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.375) internal successors, (154), 112 states have internal predecessors, (154), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:44:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2024-11-13 12:44:12,246 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 168 [2024-11-13 12:44:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:12,249 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2024-11-13 12:44:12,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2024-11-13 12:44:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 12:44:12,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:12,260 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:44:12,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1964093638, now seen corresponding path program 1 times [2024-11-13 12:44:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475541290] [2024-11-13 12:44:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475541290] [2024-11-13 12:44:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475541290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:12,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:12,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204387786] [2024-11-13 12:44:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:12,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:12,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:12,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:12,637 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:12,840 INFO L93 Difference]: Finished difference Result 395 states and 608 transitions. [2024-11-13 12:44:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-13 12:44:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:12,849 INFO L225 Difference]: With dead ends: 395 [2024-11-13 12:44:12,851 INFO L226 Difference]: Without dead ends: 231 [2024-11-13 12:44:12,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:12,856 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 43 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:12,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 282 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-13 12:44:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 185. [2024-11-13 12:44:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:44:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2024-11-13 12:44:12,921 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 169 [2024-11-13 12:44:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:12,923 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2024-11-13 12:44:12,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2024-11-13 12:44:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 12:44:12,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:12,930 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:12,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:44:12,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1036799320, now seen corresponding path program 1 times [2024-11-13 12:44:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640980360] [2024-11-13 12:44:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640980360] [2024-11-13 12:44:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640980360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:13,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681560897] [2024-11-13 12:44:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:13,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:13,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:13,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:13,310 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:13,477 INFO L93 Difference]: Finished difference Result 541 states and 836 transitions. [2024-11-13 12:44:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-13 12:44:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:13,485 INFO L225 Difference]: With dead ends: 541 [2024-11-13 12:44:13,486 INFO L226 Difference]: Without dead ends: 359 [2024-11-13 12:44:13,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:13,489 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:13,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-13 12:44:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2024-11-13 12:44:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 248 states have (on average 1.3709677419354838) internal successors, (340), 248 states have internal predecessors, (340), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-13 12:44:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2024-11-13 12:44:13,579 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 169 [2024-11-13 12:44:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:13,580 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2024-11-13 12:44:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2024-11-13 12:44:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 12:44:13,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:13,587 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:13,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:44:13,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:13,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1446368452, now seen corresponding path program 1 times [2024-11-13 12:44:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736948214] [2024-11-13 12:44:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736948214] [2024-11-13 12:44:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736948214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:44:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172390751] [2024-11-13 12:44:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:14,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:44:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:14,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:44:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:44:14,172 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:14,627 INFO L93 Difference]: Finished difference Result 893 states and 1374 transitions. [2024-11-13 12:44:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-13 12:44:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:14,639 INFO L225 Difference]: With dead ends: 893 [2024-11-13 12:44:14,640 INFO L226 Difference]: Without dead ends: 715 [2024-11-13 12:44:14,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:14,643 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 130 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:14,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 409 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-13 12:44:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 707. [2024-11-13 12:44:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 490 states have (on average 1.3755102040816327) internal successors, (674), 490 states have internal predecessors, (674), 208 states have call successors, (208), 8 states have call predecessors, (208), 8 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-13 12:44:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1090 transitions. [2024-11-13 12:44:14,746 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1090 transitions. Word has length 170 [2024-11-13 12:44:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:14,747 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1090 transitions. [2024-11-13 12:44:14,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1090 transitions. [2024-11-13 12:44:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 12:44:14,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:14,752 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:14,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:44:14,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:14,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1416559652, now seen corresponding path program 1 times [2024-11-13 12:44:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:14,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795207433] [2024-11-13 12:44:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:14,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795207433] [2024-11-13 12:44:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795207433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:15,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906357379] [2024-11-13 12:44:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:15,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:15,185 INFO L87 Difference]: Start difference. First operand 707 states and 1090 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:15,364 INFO L93 Difference]: Finished difference Result 1773 states and 2738 transitions. [2024-11-13 12:44:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-13 12:44:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:15,373 INFO L225 Difference]: With dead ends: 1773 [2024-11-13 12:44:15,373 INFO L226 Difference]: Without dead ends: 1069 [2024-11-13 12:44:15,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:15,376 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:15,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 238 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-13 12:44:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1067. [2024-11-13 12:44:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 742 states have (on average 1.371967654986523) internal successors, (1018), 742 states have internal predecessors, (1018), 312 states have call successors, (312), 12 states have call predecessors, (312), 12 states have return successors, (312), 312 states have call predecessors, (312), 312 states have call successors, (312) [2024-11-13 12:44:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1642 transitions. [2024-11-13 12:44:15,538 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1642 transitions. Word has length 170 [2024-11-13 12:44:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1642 transitions. [2024-11-13 12:44:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1642 transitions. [2024-11-13 12:44:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 12:44:15,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:15,541 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:15,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:44:15,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 171788250, now seen corresponding path program 1 times [2024-11-13 12:44:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:15,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833486057] [2024-11-13 12:44:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 75 proven. 69 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-13 12:44:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833486057] [2024-11-13 12:44:17,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833486057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686541914] [2024-11-13 12:44:17,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:17,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:17,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:44:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 12:44:17,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 832 proven. 153 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-13 12:44:19,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 111 proven. 171 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-13 12:44:21,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686541914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:21,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 32 [2024-11-13 12:44:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729921376] [2024-11-13 12:44:21,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:21,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 12:44:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:21,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 12:44:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:44:21,910 INFO L87 Difference]: Start difference. First operand 1067 states and 1642 transitions. Second operand has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (64), 5 states have call predecessors, (64), 12 states have return successors, (66), 11 states have call predecessors, (66), 11 states have call successors, (66) [2024-11-13 12:44:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:24,491 INFO L93 Difference]: Finished difference Result 1835 states and 2668 transitions. [2024-11-13 12:44:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 12:44:24,492 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (64), 5 states have call predecessors, (64), 12 states have return successors, (66), 11 states have call predecessors, (66), 11 states have call successors, (66) Word has length 170 [2024-11-13 12:44:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:24,499 INFO L225 Difference]: With dead ends: 1835 [2024-11-13 12:44:24,500 INFO L226 Difference]: Without dead ends: 1131 [2024-11-13 12:44:24,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=951, Invalid=2355, Unknown=0, NotChecked=0, Total=3306 [2024-11-13 12:44:24,504 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 391 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:24,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 792 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:44:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-13 12:44:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 645. [2024-11-13 12:44:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 488 states have (on average 1.3360655737704918) internal successors, (652), 492 states have internal predecessors, (652), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-13 12:44:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 908 transitions. [2024-11-13 12:44:24,625 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 908 transitions. Word has length 170 [2024-11-13 12:44:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:24,626 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 908 transitions. [2024-11-13 12:44:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (64), 5 states have call predecessors, (64), 12 states have return successors, (66), 11 states have call predecessors, (66), 11 states have call successors, (66) [2024-11-13 12:44:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 908 transitions. [2024-11-13 12:44:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 12:44:24,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:24,629 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:24,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:44:24,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:24,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2062661050, now seen corresponding path program 1 times [2024-11-13 12:44:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498962850] [2024-11-13 12:44:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498962850] [2024-11-13 12:44:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498962850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:25,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018448788] [2024-11-13 12:44:25,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:25,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:25,170 INFO L87 Difference]: Start difference. First operand 645 states and 908 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:25,706 INFO L93 Difference]: Finished difference Result 1317 states and 1844 transitions. [2024-11-13 12:44:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:25,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-13 12:44:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:25,717 INFO L225 Difference]: With dead ends: 1317 [2024-11-13 12:44:25,717 INFO L226 Difference]: Without dead ends: 1155 [2024-11-13 12:44:25,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:25,720 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 130 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:25,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 332 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-13 12:44:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 931. [2024-11-13 12:44:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 696 states have (on average 1.3189655172413792) internal successors, (918), 702 states have internal predecessors, (918), 192 states have call successors, (192), 42 states have call predecessors, (192), 42 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-13 12:44:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1302 transitions. [2024-11-13 12:44:25,888 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1302 transitions. Word has length 171 [2024-11-13 12:44:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:25,889 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1302 transitions. [2024-11-13 12:44:25,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1302 transitions. [2024-11-13 12:44:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 12:44:25,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:25,895 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:25,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:44:25,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:25,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1747770048, now seen corresponding path program 1 times [2024-11-13 12:44:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:25,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058285126] [2024-11-13 12:44:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058285126] [2024-11-13 12:44:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058285126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:26,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:26,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939728340] [2024-11-13 12:44:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:26,363 INFO L87 Difference]: Start difference. First operand 931 states and 1302 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:27,017 INFO L93 Difference]: Finished difference Result 2026 states and 2848 transitions. [2024-11-13 12:44:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:27,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-13 12:44:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:27,028 INFO L225 Difference]: With dead ends: 2026 [2024-11-13 12:44:27,030 INFO L226 Difference]: Without dead ends: 1557 [2024-11-13 12:44:27,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:27,033 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 280 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:27,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 454 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-13 12:44:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1434. [2024-11-13 12:44:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1071 states have (on average 1.323062558356676) internal successors, (1417), 1077 states have internal predecessors, (1417), 296 states have call successors, (296), 66 states have call predecessors, (296), 66 states have return successors, (296), 290 states have call predecessors, (296), 296 states have call successors, (296) [2024-11-13 12:44:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2009 transitions. [2024-11-13 12:44:27,297 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2009 transitions. Word has length 171 [2024-11-13 12:44:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:27,299 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2009 transitions. [2024-11-13 12:44:27,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2009 transitions. [2024-11-13 12:44:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 12:44:27,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:27,304 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:27,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:44:27,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:27,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash 766919243, now seen corresponding path program 1 times [2024-11-13 12:44:27,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:27,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741171851] [2024-11-13 12:44:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741171851] [2024-11-13 12:44:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741171851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500649739] [2024-11-13 12:44:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:27,854 INFO L87 Difference]: Start difference. First operand 1434 states and 2009 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-13 12:44:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:28,906 INFO L93 Difference]: Finished difference Result 3224 states and 4515 transitions. [2024-11-13 12:44:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-13 12:44:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:28,920 INFO L225 Difference]: With dead ends: 3224 [2024-11-13 12:44:28,920 INFO L226 Difference]: Without dead ends: 1793 [2024-11-13 12:44:28,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:44:28,925 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 407 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:28,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 567 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:44:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-11-13 12:44:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1773. [2024-11-13 12:44:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1332 states have (on average 1.3243243243243243) internal successors, (1764), 1340 states have internal predecessors, (1764), 360 states have call successors, (360), 80 states have call predecessors, (360), 80 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360) [2024-11-13 12:44:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2484 transitions. [2024-11-13 12:44:29,217 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2484 transitions. Word has length 171 [2024-11-13 12:44:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:29,218 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2484 transitions. [2024-11-13 12:44:29,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-13 12:44:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2484 transitions. [2024-11-13 12:44:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 12:44:29,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:29,222 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:44:29,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1199295177, now seen corresponding path program 1 times [2024-11-13 12:44:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982313821] [2024-11-13 12:44:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:30,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982313821] [2024-11-13 12:44:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982313821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:44:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695946302] [2024-11-13 12:44:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:44:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:30,156 INFO L87 Difference]: Start difference. First operand 1773 states and 2484 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:31,086 INFO L93 Difference]: Finished difference Result 2969 states and 4155 transitions. [2024-11-13 12:44:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:31,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-13 12:44:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:31,098 INFO L225 Difference]: With dead ends: 2969 [2024-11-13 12:44:31,099 INFO L226 Difference]: Without dead ends: 2031 [2024-11-13 12:44:31,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:31,102 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 278 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:31,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 488 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:44:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-11-13 12:44:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1875. [2024-11-13 12:44:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1434 states have (on average 1.3284518828451883) internal successors, (1905), 1442 states have internal predecessors, (1905), 360 states have call successors, (360), 80 states have call predecessors, (360), 80 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360) [2024-11-13 12:44:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2625 transitions. [2024-11-13 12:44:31,439 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2625 transitions. Word has length 172 [2024-11-13 12:44:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:31,440 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2625 transitions. [2024-11-13 12:44:31,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:44:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2625 transitions. [2024-11-13 12:44:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 12:44:31,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:31,444 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:31,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:44:31,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:31,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 116026877, now seen corresponding path program 1 times [2024-11-13 12:44:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22855411] [2024-11-13 12:44:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:44:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:44:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:44:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:44:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:44:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:44:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 12:44:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 12:44:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 12:44:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 12:44:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 12:44:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 12:44:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-13 12:44:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 12:44:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-13 12:44:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:44:31,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:31,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22855411] [2024-11-13 12:44:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22855411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:31,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354538069] [2024-11-13 12:44:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:31,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:31,906 INFO L87 Difference]: Start difference. First operand 1875 states and 2625 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-13 12:44:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:33,012 INFO L93 Difference]: Finished difference Result 3683 states and 5144 transitions. [2024-11-13 12:44:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:44:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-13 12:44:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:33,031 INFO L225 Difference]: With dead ends: 3683 [2024-11-13 12:44:33,032 INFO L226 Difference]: Without dead ends: 2770 [2024-11-13 12:44:33,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:33,036 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 333 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:33,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 599 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:44:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2024-11-13 12:44:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2760. [2024-11-13 12:44:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2099 states have (on average 1.3211052882324916) internal successors, (2773), 2111 states have internal predecessors, (2773), 540 states have call successors, (540), 120 states have call predecessors, (540), 120 states have return successors, (540), 528 states have call predecessors, (540), 540 states have call successors, (540) [2024-11-13 12:44:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3853 transitions. [2024-11-13 12:44:33,533 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3853 transitions. Word has length 172 [2024-11-13 12:44:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 3853 transitions. [2024-11-13 12:44:33,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-13 12:44:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3853 transitions. [2024-11-13 12:44:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 12:44:33,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:33,537 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:33,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:44:33,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:33,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1335859047, now seen corresponding path program 1 times [2024-11-13 12:44:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:33,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547191268] [2024-11-13 12:44:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855816661] [2024-11-13 12:44:33,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:33,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:33,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:33,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:44:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:33,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:34,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:34,027 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:44:34,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:44:34,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:44:34,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:34,235 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:34,404 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:44:34,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:44:34 BoogieIcfgContainer [2024-11-13 12:44:34,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:44:34,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:44:34,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:44:34,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:44:34,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:10" (3/4) ... [2024-11-13 12:44:34,416 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:44:34,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:44:34,418 INFO L158 Benchmark]: Toolchain (without parser) took 25476.07ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 94.2MB in the beginning and 439.5MB in the end (delta: -345.2MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-11-13 12:44:34,419 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 142.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:44:34,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.77ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 79.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:44:34,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.45ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 75.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:44:34,420 INFO L158 Benchmark]: Boogie Preprocessor took 76.00ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 70.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:44:34,420 INFO L158 Benchmark]: RCFGBuilder took 676.93ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 45.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:44:34,420 INFO L158 Benchmark]: TraceAbstraction took 24185.45ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 45.1MB in the beginning and 439.5MB in the end (delta: -394.4MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2024-11-13 12:44:34,421 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 520.1MB. Free memory was 439.5MB in the beginning and 439.5MB in the end (delta: 68.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:44:34,422 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.50ms. Allocated memory is still 142.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.77ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 79.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.45ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 75.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.00ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 70.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 676.93ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 45.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24185.45ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 45.1MB in the beginning and 439.5MB in the end (delta: -394.4MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 520.1MB. Free memory was 439.5MB in the beginning and 439.5MB in the end (delta: 68.3kB). Peak memory consumption was 8.4MB. 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 bitwiseOr at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned long int var_1_25 = 4; [L39] unsigned short int var_1_26 = 2; [L40] unsigned short int var_1_27 = 100; [L41] signed char var_1_28 = 32; [L42] double var_1_29 = 16.25; [L43] double var_1_30 = 15.75; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 7.25; [L49] float var_1_36 = 1.75; [L50] signed long int var_1_37 = 0; [L51] unsigned long int last_1_var_1_10 = 256; [L52] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L154] last_1_var_1_10 = var_1_10 [L155] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L112] var_1_3 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L113] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L114] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L114] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L115] var_1_5 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L116] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L117] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L117] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L118] var_1_13 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L119] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L120] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L120] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L121] var_1_14 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L122] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L123] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L123] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L124] var_1_15 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L125] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L126] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L126] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L127] var_1_16 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L128] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L129] var_1_21 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L130] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L131] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L131] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L132] var_1_22 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L133] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L134] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L134] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L135] var_1_25 = __VERIFIER_nondet_ulong() [L136] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L136] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L137] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L137] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L138] var_1_27 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L139] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L140] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L140] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L141] var_1_30 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L142] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L143] var_1_32 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L144] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L145] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L146] var_1_33 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L147] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L148] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L149] var_1_34 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L150] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L151] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L151] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L166] RET updateVariables() [L167] CALL step() [L56] var_1_24 = var_1_25 [L57] var_1_26 = var_1_27 [L58] var_1_28 = -2 [L59] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L60] COND TRUE var_1_32 || var_1_33 [L61] var_1_31 = var_1_34 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L63] var_1_35 = var_1_30 [L64] var_1_36 = var_1_30 [L65] var_1_37 = var_1_27 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L66] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L71] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L72] COND FALSE !(stepLocal_2 > last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L75] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L80] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L81] COND FALSE !(stepLocal_1 || var_1_3) [L86] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L88] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L99] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L104] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L104] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L105] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L106] COND TRUE var_1_12 == var_1_12 [L107] var_1_10 = 0u VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L158-L159] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2256 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2256 mSDsluCounter, 4771 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3253 mSDsCounter, 757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2351 IncrementalHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 757 mSolverCounterUnsat, 1518 mSDtfsCounter, 2351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1024 GetRequests, 917 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2760occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1079 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 2387 NumberOfCodeBlocks, 2387 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2200 ConstructedInterpolants, 0 QuantifiedInterpolants, 10196 SizeOfPredicates, 7 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 16507/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 12:44:34,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:37,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:37,222 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 12:44:37,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:37,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:37,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:37,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:37,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:37,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:37,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:37,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:44:37,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:44:37,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:37,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:37,278 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:37,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:37,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:44:37,278 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:37,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:37,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:37,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:37,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:37,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:44:37,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:44:37,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:44:37,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c [2024-11-13 12:44:37,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:37,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:37,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:37,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:37,640 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:37,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i Unable to find full path for "g++" [2024-11-13 12:44:39,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:40,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:40,043 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-13 12:44:40,056 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data/ab82ad040/4895f1f2d81b4698b90ee6e4d6fe1a5e/FLAG7f58e4f15 [2024-11-13 12:44:40,081 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/data/ab82ad040/4895f1f2d81b4698b90ee6e4d6fe1a5e [2024-11-13 12:44:40,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:40,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:40,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:40,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:40,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:40,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24580c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40, skipping insertion in model container [2024-11-13 12:44:40,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:40,318 WARN L250 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_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-13 12:44:40,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:40,461 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:40,478 WARN L250 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_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-13 12:44:40,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:40,626 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:40,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40 WrapperNode [2024-11-13 12:44:40,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:40,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:40,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:40,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:40,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,744 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-13 12:44:40,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:40,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:40,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:40,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:40,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,802 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:44:40,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:40,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:40,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:40,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:40,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:40,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:40,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:44:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:44:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:44:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:41,038 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:41,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:56,076 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:56,076 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:56,087 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:56,087 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:44:56,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:56 BoogieIcfgContainer [2024-11-13 12:44:56,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:56,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:44:56,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:44:56,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:44:56,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:44:40" (1/3) ... [2024-11-13 12:44:56,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ce3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:56, skipping insertion in model container [2024-11-13 12:44:56,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (2/3) ... [2024-11-13 12:44:56,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ce3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:56, skipping insertion in model container [2024-11-13 12:44:56,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:56" (3/3) ... [2024-11-13 12:44:56,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-13 12:44:56,113 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:44:56,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:44:56,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:44:56,189 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dc1d996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:44:56,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:44:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 12:44:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 12:44:56,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:56,212 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:56,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash 503140694, now seen corresponding path program 1 times [2024-11-13 12:44:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:44:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585357921] [2024-11-13 12:44:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:56,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:44:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:44:56,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:44:56,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 12:44:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 12:44:57,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-13 12:44:57,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:44:57,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:44:57,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585357921] [2024-11-13 12:44:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585357921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:44:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186463256] [2024-11-13 12:44:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:57,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:44:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:44:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:44:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:44:57,813 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-13 12:44:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:57,869 INFO L93 Difference]: Finished difference Result 151 states and 266 transitions. [2024-11-13 12:44:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:44:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-13 12:44:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:57,878 INFO L225 Difference]: With dead ends: 151 [2024-11-13 12:44:57,878 INFO L226 Difference]: Without dead ends: 75 [2024-11-13 12:44:57,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:44:57,884 INFO L432 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:57,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-13 12:44:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-13 12:44:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 12:44:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2024-11-13 12:44:57,945 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 165 [2024-11-13 12:44:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:57,945 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2024-11-13 12:44:57,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-13 12:44:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2024-11-13 12:44:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 12:44:57,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:57,954 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:57,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 12:44:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:44:58,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:58,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2028772646, now seen corresponding path program 1 times [2024-11-13 12:44:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:44:58,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515182763] [2024-11-13 12:44:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:44:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:44:58,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:44:58,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 12:44:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:44:59,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:45:02,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:02,827 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515182763] [2024-11-13 12:45:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515182763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525475264] [2024-11-13 12:45:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:02,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:02,832 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:45:07,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:11,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:15,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:19,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:23,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:28,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:31,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:33,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:39,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:43,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:47,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:51,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:45:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:51,859 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2024-11-13 12:45:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-13 12:45:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:51,975 INFO L225 Difference]: With dead ends: 219 [2024-11-13 12:45:51,975 INFO L226 Difference]: Without dead ends: 147 [2024-11-13 12:45:51,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:51,977 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 31 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:51,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 354 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 48.9s Time] [2024-11-13 12:45:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-13 12:45:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-13 12:45:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:45:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 223 transitions. [2024-11-13 12:45:52,023 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 223 transitions. Word has length 165 [2024-11-13 12:45:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:52,038 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 223 transitions. [2024-11-13 12:45:52,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:45:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 223 transitions. [2024-11-13 12:45:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 12:45:52,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:52,047 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:52,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:45:52,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:52,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:52,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1253811025, now seen corresponding path program 1 times [2024-11-13 12:45:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:52,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201710502] [2024-11-13 12:45:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:52,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:52,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:45:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:53,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:45:53,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:45:53,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:53,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201710502] [2024-11-13 12:45:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201710502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092762493] [2024-11-13 12:45:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:53,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:53,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:53,668 INFO L87 Difference]: Start difference. First operand 145 states and 223 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:45:58,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:02,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:02,314 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2024-11-13 12:46:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:46:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-13 12:46:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:02,318 INFO L225 Difference]: With dead ends: 329 [2024-11-13 12:46:02,318 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 12:46:02,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:46:02,324 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 29 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:02,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 220 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-13 12:46:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 12:46:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2024-11-13 12:46:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 247 transitions. [2024-11-13 12:46:02,369 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 247 transitions. Word has length 166 [2024-11-13 12:46:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:02,370 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 247 transitions. [2024-11-13 12:46:02,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:46:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 247 transitions. [2024-11-13 12:46:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 12:46:02,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:02,377 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:02,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 12:46:02,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:02,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:02,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1131391057, now seen corresponding path program 1 times [2024-11-13 12:46:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241944301] [2024-11-13 12:46:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:02,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:02,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:46:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:03,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:46:03,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:46:04,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:04,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241944301] [2024-11-13 12:46:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241944301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:46:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258876610] [2024-11-13 12:46:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:46:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:46:04,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:46:04,005 INFO L87 Difference]: Start difference. First operand 162 states and 247 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:46:08,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:12,588 INFO L93 Difference]: Finished difference Result 345 states and 522 transitions. [2024-11-13 12:46:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:46:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-13 12:46:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:12,592 INFO L225 Difference]: With dead ends: 345 [2024-11-13 12:46:12,592 INFO L226 Difference]: Without dead ends: 186 [2024-11-13 12:46:12,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:46:12,594 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 29 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:12,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 223 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-13 12:46:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-13 12:46:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2024-11-13 12:46:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:46:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2024-11-13 12:46:12,619 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 167 [2024-11-13 12:46:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 241 transitions. [2024-11-13 12:46:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:46:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 241 transitions. [2024-11-13 12:46:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 12:46:12,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:12,623 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:12,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:46:12,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:12,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:12,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1837927595, now seen corresponding path program 1 times [2024-11-13 12:46:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:12,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991982941] [2024-11-13 12:46:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:12,827 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:12,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:46:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:13,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:46:13,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:46:24,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:24,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991982941] [2024-11-13 12:46:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991982941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141187398] [2024-11-13 12:46:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:24,626 INFO L87 Difference]: Start difference. First operand 162 states and 241 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:46:30,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:34,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:38,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:42,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:46,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:50,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:54,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:58,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:02,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:03,940 INFO L93 Difference]: Finished difference Result 639 states and 955 transitions. [2024-11-13 12:47:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:47:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-13 12:47:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:03,948 INFO L225 Difference]: With dead ends: 639 [2024-11-13 12:47:03,948 INFO L226 Difference]: Without dead ends: 480 [2024-11-13 12:47:03,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:47:03,952 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 92 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 53 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:03,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 569 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 226 Invalid, 9 Unknown, 0 Unchecked, 39.0s Time] [2024-11-13 12:47:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-13 12:47:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 472. [2024-11-13 12:47:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 309 states have (on average 1.284789644012945) internal successors, (397), 309 states have internal predecessors, (397), 156 states have call successors, (156), 6 states have call predecessors, (156), 6 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-13 12:47:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 709 transitions. [2024-11-13 12:47:04,051 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 709 transitions. Word has length 168 [2024-11-13 12:47:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:04,052 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 709 transitions. [2024-11-13 12:47:04,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:47:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 709 transitions. [2024-11-13 12:47:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 12:47:04,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:04,057 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:04,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 12:47:04,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:04,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1445922451, now seen corresponding path program 1 times [2024-11-13 12:47:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:47:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427722244] [2024-11-13 12:47:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:04,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:47:04,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:47:04,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:47:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:05,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:47:05,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:47:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:47:12,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:47:12,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:47:12,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427722244] [2024-11-13 12:47:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427722244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:47:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531212153] [2024-11-13 12:47:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:12,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:47:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:47:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:47:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:47:12,007 INFO L87 Difference]: Start difference. First operand 472 states and 709 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:47:18,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:22,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:26,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:30,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:34,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:38,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:42,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:44,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:52,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:52,184 INFO L93 Difference]: Finished difference Result 904 states and 1335 transitions. [2024-11-13 12:47:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:47:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-13 12:47:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:52,288 INFO L225 Difference]: With dead ends: 904 [2024-11-13 12:47:52,289 INFO L226 Difference]: Without dead ends: 745 [2024-11-13 12:47:52,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:47:52,291 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 319 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 105 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:52,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 640 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 333 Invalid, 8 Unknown, 0 Unchecked, 39.5s Time] [2024-11-13 12:47:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-13 12:47:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 627. [2024-11-13 12:47:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 410 states have (on average 1.2829268292682927) internal successors, (526), 410 states have internal predecessors, (526), 208 states have call successors, (208), 8 states have call predecessors, (208), 8 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-13 12:47:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 942 transitions. [2024-11-13 12:47:52,380 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 942 transitions. Word has length 168 [2024-11-13 12:47:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:52,382 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 942 transitions. [2024-11-13 12:47:52,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:47:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 942 transitions. [2024-11-13 12:47:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 12:47:52,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:52,385 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:52,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 12:47:52,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:52,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 816859241, now seen corresponding path program 1 times [2024-11-13 12:47:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:47:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147812460] [2024-11-13 12:47:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:47:52,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:47:52,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 (8)] Waiting until timeout for monitored process [2024-11-13 12:47:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:53,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:47:53,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:47:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:47:59,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:47:59,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:47:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147812460] [2024-11-13 12:47:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147812460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:47:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160729257] [2024-11-13 12:47:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:59,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:47:59,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:47:59,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:47:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:47:59,691 INFO L87 Difference]: Start difference. First operand 627 states and 942 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:48:04,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:08,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:12,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:17,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:21,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:21,293 INFO L93 Difference]: Finished difference Result 1751 states and 2613 transitions. [2024-11-13 12:48:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:48:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-13 12:48:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:21,417 INFO L225 Difference]: With dead ends: 1751 [2024-11-13 12:48:21,417 INFO L226 Difference]: Without dead ends: 1127 [2024-11-13 12:48:21,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:21,422 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 124 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:21,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 310 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 21.4s Time] [2024-11-13 12:48:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-13 12:48:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1007. [2024-11-13 12:48:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 655 states have (on average 1.2732824427480915) internal successors, (834), 655 states have internal predecessors, (834), 338 states have call successors, (338), 13 states have call predecessors, (338), 13 states have return successors, (338), 338 states have call predecessors, (338), 338 states have call successors, (338) [2024-11-13 12:48:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1510 transitions. [2024-11-13 12:48:21,600 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1510 transitions. Word has length 168 [2024-11-13 12:48:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:21,613 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1510 transitions. [2024-11-13 12:48:21,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:48:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1510 transitions. [2024-11-13 12:48:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 12:48:21,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:21,618 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:21,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 (8)] Forceful destruction successful, exit code 0 [2024-11-13 12:48:21,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:48:21,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2144178563, now seen corresponding path program 1 times [2024-11-13 12:48:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:48:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065183511] [2024-11-13 12:48:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:21,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:48:21,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:48:21,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:48:21,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 (9)] Waiting until timeout for monitored process [2024-11-13 12:48:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:22,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:48:22,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-13 12:48:26,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:48:26,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:48:26,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065183511] [2024-11-13 12:48:26,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065183511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:26,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:26,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101107880] [2024-11-13 12:48:26,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:26,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:26,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:48:26,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:26,371 INFO L87 Difference]: Start difference. First operand 1007 states and 1510 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:48:32,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:36,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:40,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:44,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:48,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:52,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:55,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:48:59,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:03,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:09,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:13,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:17,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:21,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:25,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:29,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:35,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:38,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:49:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:38,635 INFO L93 Difference]: Finished difference Result 1841 states and 2788 transitions. [2024-11-13 12:49:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:49:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-13 12:49:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:38,646 INFO L225 Difference]: With dead ends: 1841 [2024-11-13 12:49:38,646 INFO L226 Difference]: Without dead ends: 1369 [2024-11-13 12:49:38,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:49:38,650 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 229 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:38,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 304 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 15 Unknown, 0 Unchecked, 72.1s Time] [2024-11-13 12:49:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-13 12:49:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1330. [2024-11-13 12:49:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 843 states have (on average 1.2455516014234875) internal successors, (1050), 843 states have internal predecessors, (1050), 468 states have call successors, (468), 18 states have call predecessors, (468), 18 states have return successors, (468), 468 states have call predecessors, (468), 468 states have call successors, (468) [2024-11-13 12:49:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1986 transitions. [2024-11-13 12:49:38,832 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1986 transitions. Word has length 169 [2024-11-13 12:49:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:38,832 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1986 transitions. [2024-11-13 12:49:38,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-13 12:49:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1986 transitions. [2024-11-13 12:49:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 12:49:38,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:38,837 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:38,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 (9)] Ended with exit code 0 [2024-11-13 12:49:39,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:39,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:49:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash 905620378, now seen corresponding path program 1 times [2024-11-13 12:49:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:49:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914670320] [2024-11-13 12:49:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:39,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:49:39,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:49:39,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d25c0f-aaf0-4fbf-b765-5b2e1bdf5b80/bin/uautomizer-verify-qhAvR1uOyd/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 (10)] Waiting until timeout for monitored process [2024-11-13 12:49:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:40,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:49:40,245 INFO L278 TraceCheckSpWp]: Computing forward predicates...