./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:05:33,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:05:34,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:05:34,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:05:34,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:05:34,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:05:34,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:05:34,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:05:34,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:05:34,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:05:34,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:05:34,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:05:34,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:05:34,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:05:34,144 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:05:34,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:05:34,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:05:34,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:05:34,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:05:34,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:05:34,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:05:34,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:05:34,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:05:34,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:05:34,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:05:34,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:05:34,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:05:34,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:05:34,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:05:34,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:05:34,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:05:34,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:05:34,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:05:34,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:05:34,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:05:34,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:05:34,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:05:34,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:05:34,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:05:34,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:05:34,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:05:34,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:05:34,156 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f [2024-10-31 22:05:34,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:05:34,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:05:34,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:05:34,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:05:34,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:05:34,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i Unable to find full path for "g++" [2024-10-31 22:05:36,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:05:36,790 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:05:36,791 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2024-10-31 22:05:36,801 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/data/7b492aae6/6c5b1cad7cd041ac9ab35d0902994b54/FLAG5104e4775 [2024-10-31 22:05:36,817 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/data/7b492aae6/6c5b1cad7cd041ac9ab35d0902994b54 [2024-10-31 22:05:36,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:05:36,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:05:36,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:05:36,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:05:36,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:05:36,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:05:36" (1/1) ... [2024-10-31 22:05:36,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0c663f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:36, skipping insertion in model container [2024-10-31 22:05:36,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:05:36" (1/1) ... [2024-10-31 22:05:36,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:05:37,057 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2024-10-31 22:05:37,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:05:37,134 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:05:37,145 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2024-10-31 22:05:37,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:05:37,202 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:05:37,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37 WrapperNode [2024-10-31 22:05:37,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:05:37,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:05:37,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:05:37,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:05:37,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,282 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-10-31 22:05:37,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:05:37,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:05:37,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:05:37,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:05:37,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,325 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:05:37,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:05:37,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:05:37,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:05:37,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:05:37,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (1/1) ... [2024-10-31 22:05:37,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:05:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:05:37,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:05:37,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:05:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:05:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:05:37,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:05:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:05:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:05:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:05:37,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:05:37,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:05:38,098 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-31 22:05:38,099 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:05:38,118 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:05:38,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:05:38,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:38 BoogieIcfgContainer [2024-10-31 22:05:38,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:05:38,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:05:38,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:05:38,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:05:38,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:05:36" (1/3) ... [2024-10-31 22:05:38,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f81bce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:05:38, skipping insertion in model container [2024-10-31 22:05:38,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:37" (2/3) ... [2024-10-31 22:05:38,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f81bce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:05:38, skipping insertion in model container [2024-10-31 22:05:38,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:38" (3/3) ... [2024-10-31 22:05:38,136 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-97.i [2024-10-31 22:05:38,156 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:05:38,156 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:05:38,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:05:38,253 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;@2912a738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:05:38,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:05:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:05:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:05:38,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:38,273 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:38,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:38,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 499405746, now seen corresponding path program 1 times [2024-10-31 22:05:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840520213] [2024-10-31 22:05:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:38,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840520213] [2024-10-31 22:05:38,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840520213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:38,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:38,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570277821] [2024-10-31 22:05:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:38,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:05:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:38,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:05:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:05:38,901 INFO L87 Difference]: Start difference. First operand has 80 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 22:05:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:38,936 INFO L93 Difference]: Finished difference Result 153 states and 252 transitions. [2024-10-31 22:05:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:05:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 109 [2024-10-31 22:05:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:38,952 INFO L225 Difference]: With dead ends: 153 [2024-10-31 22:05:38,952 INFO L226 Difference]: Without dead ends: 76 [2024-10-31 22:05:38,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:05:38,964 INFO L432 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:38,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:05:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-31 22:05:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-31 22:05:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:05:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-10-31 22:05:39,029 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 109 [2024-10-31 22:05:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:39,030 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-10-31 22:05:39,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 22:05:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-10-31 22:05:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:05:39,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:39,038 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:39,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:05:39,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1205396974, now seen corresponding path program 1 times [2024-10-31 22:05:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:39,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872315222] [2024-10-31 22:05:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872315222] [2024-10-31 22:05:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872315222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:39,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:05:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988891796] [2024-10-31 22:05:39,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:39,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:39,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:39,423 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:39,551 INFO L93 Difference]: Finished difference Result 204 states and 306 transitions. [2024-10-31 22:05:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:39,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-31 22:05:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:39,554 INFO L225 Difference]: With dead ends: 204 [2024-10-31 22:05:39,554 INFO L226 Difference]: Without dead ends: 131 [2024-10-31 22:05:39,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10-31 22:05:39,560 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 98 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:39,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 251 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:05:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-31 22:05:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 91. [2024-10-31 22:05:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:05:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2024-10-31 22:05:39,590 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 109 [2024-10-31 22:05:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:39,592 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2024-10-31 22:05:39,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2024-10-31 22:05:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:05:39,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:39,601 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:39,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:05:39,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:39,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 618590960, now seen corresponding path program 1 times [2024-10-31 22:05:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:39,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727656509] [2024-10-31 22:05:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:39,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:40,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727656509] [2024-10-31 22:05:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727656509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:40,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:05:40,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340360674] [2024-10-31 22:05:40,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:40,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:05:40,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:05:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:05:40,181 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:40,458 INFO L93 Difference]: Finished difference Result 294 states and 437 transitions. [2024-10-31 22:05:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:05:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-31 22:05:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:40,462 INFO L225 Difference]: With dead ends: 294 [2024-10-31 22:05:40,462 INFO L226 Difference]: Without dead ends: 206 [2024-10-31 22:05:40,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:05:40,464 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 116 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:40,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 292 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:05:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-31 22:05:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 171. [2024-10-31 22:05:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.375) internal successors, (187), 136 states have internal predecessors, (187), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 22:05:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 251 transitions. [2024-10-31 22:05:40,492 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 251 transitions. Word has length 109 [2024-10-31 22:05:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:40,493 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 251 transitions. [2024-10-31 22:05:40,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 251 transitions. [2024-10-31 22:05:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-31 22:05:40,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:40,496 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:40,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:05:40,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:40,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1888189223, now seen corresponding path program 1 times [2024-10-31 22:05:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259297410] [2024-10-31 22:05:40,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:41,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259297410] [2024-10-31 22:05:41,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259297410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:41,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:41,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:05:41,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155642858] [2024-10-31 22:05:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:41,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:41,082 INFO L87 Difference]: Start difference. First operand 171 states and 251 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:41,426 INFO L93 Difference]: Finished difference Result 422 states and 618 transitions. [2024-10-31 22:05:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:05:41,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-31 22:05:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:41,430 INFO L225 Difference]: With dead ends: 422 [2024-10-31 22:05:41,430 INFO L226 Difference]: Without dead ends: 254 [2024-10-31 22:05:41,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:05:41,436 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 185 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:41,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 296 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:05:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-31 22:05:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2024-10-31 22:05:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 180 states have (on average 1.3388888888888888) internal successors, (241), 180 states have internal predecessors, (241), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:05:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 337 transitions. [2024-10-31 22:05:41,488 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 337 transitions. Word has length 110 [2024-10-31 22:05:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:41,489 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 337 transitions. [2024-10-31 22:05:41,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 337 transitions. [2024-10-31 22:05:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-31 22:05:41,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:41,495 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:41,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:05:41,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:41,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 40514886, now seen corresponding path program 1 times [2024-10-31 22:05:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071458481] [2024-10-31 22:05:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071458481] [2024-10-31 22:05:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071458481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:41,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:05:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032023793] [2024-10-31 22:05:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:41,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:41,771 INFO L87 Difference]: Start difference. First operand 232 states and 337 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:41,805 INFO L93 Difference]: Finished difference Result 416 states and 604 transitions. [2024-10-31 22:05:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-31 22:05:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:41,810 INFO L225 Difference]: With dead ends: 416 [2024-10-31 22:05:41,813 INFO L226 Difference]: Without dead ends: 233 [2024-10-31 22:05:41,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-10-31 22:05:41,816 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:41,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:05:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-31 22:05:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-10-31 22:05:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 181 states have internal predecessors, (240), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:05:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2024-10-31 22:05:41,858 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 111 [2024-10-31 22:05:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:41,863 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2024-10-31 22:05:41,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2024-10-31 22:05:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-31 22:05:41,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:41,865 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:41,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:05:41,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 741579464, now seen corresponding path program 1 times [2024-10-31 22:05:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953798891] [2024-10-31 22:05:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953798891] [2024-10-31 22:05:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953798891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:42,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:42,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104700472] [2024-10-31 22:05:42,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:42,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:05:42,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:42,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:05:42,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:05:42,259 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:42,980 INFO L93 Difference]: Finished difference Result 626 states and 893 transitions. [2024-10-31 22:05:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-31 22:05:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:42,985 INFO L225 Difference]: With dead ends: 626 [2024-10-31 22:05:42,986 INFO L226 Difference]: Without dead ends: 537 [2024-10-31 22:05:42,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:05:42,988 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 282 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:42,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 448 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:05:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-31 22:05:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 412. [2024-10-31 22:05:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 326 states have (on average 1.3312883435582823) internal successors, (434), 326 states have internal predecessors, (434), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-31 22:05:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions. [2024-10-31 22:05:43,070 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 111 [2024-10-31 22:05:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:43,070 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 594 transitions. [2024-10-31 22:05:43,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions. [2024-10-31 22:05:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-31 22:05:43,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:43,073 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:43,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:05:43,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -801795698, now seen corresponding path program 1 times [2024-10-31 22:05:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944911152] [2024-10-31 22:05:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944911152] [2024-10-31 22:05:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944911152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:43,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:43,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:05:43,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538436000] [2024-10-31 22:05:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:43,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:05:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:05:43,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:05:43,622 INFO L87 Difference]: Start difference. First operand 412 states and 594 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:43,737 INFO L93 Difference]: Finished difference Result 760 states and 1100 transitions. [2024-10-31 22:05:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:05:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-31 22:05:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:43,742 INFO L225 Difference]: With dead ends: 760 [2024-10-31 22:05:43,743 INFO L226 Difference]: Without dead ends: 412 [2024-10-31 22:05:43,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:05:43,746 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 89 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:43,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 378 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:05:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-31 22:05:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-31 22:05:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 326 states have (on average 1.2914110429447854) internal successors, (421), 326 states have internal predecessors, (421), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-31 22:05:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 581 transitions. [2024-10-31 22:05:43,813 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 581 transitions. Word has length 111 [2024-10-31 22:05:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:43,814 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 581 transitions. [2024-10-31 22:05:43,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 581 transitions. [2024-10-31 22:05:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:05:43,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:43,818 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:05:43,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2049970693, now seen corresponding path program 1 times [2024-10-31 22:05:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:43,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456092693] [2024-10-31 22:05:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:05:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:05:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:05:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:05:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:05:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:05:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:05:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:05:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:05:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:05:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:05:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:05:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456092693] [2024-10-31 22:05:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456092693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:05:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780073409] [2024-10-31 22:05:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:05:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:05:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:05:53,734 INFO L87 Difference]: Start difference. First operand 412 states and 581 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:57,402 INFO L93 Difference]: Finished difference Result 943 states and 1296 transitions. [2024-10-31 22:05:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:05:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-31 22:05:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:57,407 INFO L225 Difference]: With dead ends: 943 [2024-10-31 22:05:57,408 INFO L226 Difference]: Without dead ends: 774 [2024-10-31 22:05:57,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:05:57,410 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 107 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:57,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 600 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-31 22:05:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-31 22:05:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 700. [2024-10-31 22:05:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 602 states have (on average 1.3056478405315615) internal successors, (786), 606 states have internal predecessors, (786), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-31 22:05:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 962 transitions. [2024-10-31 22:05:57,531 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 962 transitions. Word has length 115 [2024-10-31 22:05:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:57,532 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 962 transitions. [2024-10-31 22:05:57,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:05:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 962 transitions. [2024-10-31 22:05:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-31 22:05:57,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:57,534 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:57,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:05:57,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:57,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1822294777, now seen corresponding path program 1 times [2024-10-31 22:05:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:57,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258020756] [2024-10-31 22:05:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:05:57,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:05:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:05:57,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:05:57,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:05:57,701 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:05:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:05:57,706 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:57,815 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:05:57,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:05:57 BoogieIcfgContainer [2024-10-31 22:05:57,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:05:57,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:05:57,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:05:57,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:05:57,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:38" (3/4) ... [2024-10-31 22:05:57,825 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:05:57,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:05:57,827 INFO L158 Benchmark]: Toolchain (without parser) took 21005.25ms. Allocated memory was 167.8MB in the beginning and 299.9MB in the end (delta: 132.1MB). Free memory was 129.0MB in the beginning and 215.5MB in the end (delta: -86.6MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-10-31 22:05:57,827 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 119.5MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:05:57,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.55ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 113.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:05:57,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.90ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 109.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:05:57,829 INFO L158 Benchmark]: Boogie Preprocessor took 76.26ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 103.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:05:57,829 INFO L158 Benchmark]: RCFGBuilder took 761.80ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 78.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 22:05:57,829 INFO L158 Benchmark]: TraceAbstraction took 19695.81ms. Allocated memory was 167.8MB in the beginning and 299.9MB in the end (delta: 132.1MB). Free memory was 77.2MB in the beginning and 215.5MB in the end (delta: -138.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:05:57,829 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 299.9MB. Free memory is still 215.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:05:57,832 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.22ms. Allocated memory is still 119.5MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.55ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 113.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.90ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 109.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.26ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 103.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 761.80ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 78.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19695.81ms. Allocated memory was 167.8MB in the beginning and 299.9MB in the end (delta: 132.1MB). Free memory was 77.2MB in the beginning and 215.5MB in the end (delta: -138.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 299.9MB. Free memory is still 215.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L87] var_1_9 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L88] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L89] var_1_10 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L90] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] var_1_18 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] var_1_19 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] var_1_23 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L111] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L125] RET updateVariables() [L126] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] COND TRUE (var_1_20 + var_1_15) < -200 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L62] COND FALSE !(\read(var_1_22)) [L69] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L74] COND FALSE !(256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !(var_1_22 || var_1_22) [L82] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117-L118] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=5, var_1_12=63, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-5, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 2599 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1532 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 1067 mSDtfsCounter, 894 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=700occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 296 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 8694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3840/3840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:05:57,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:00,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:00,556 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:06:00,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:00,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:00,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:00,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:00,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:00,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:00,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:00,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:00,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:00,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:00,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:00,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:00,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:00,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:00,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:06:00,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:06:00,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:00,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:00,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:00,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:00,632 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:06:00,632 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:06:00,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:00,633 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:06:00,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:06:00,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:00,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:00,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:00,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:00,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:00,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:00,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:00,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:00,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:00,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:00,637 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:06:00,637 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:06:00,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:00,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:00,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:00,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:00,639 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:06:00,640 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f [2024-10-31 22:06:01,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:01,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:01,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:01,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:01,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:01,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49e04809-c458-464d-b629-f9a8b4fd15a0/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i