./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC --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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:49:28,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:49:28,349 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:49:28,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:49:28,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:49:28,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:49:28,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:49:28,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:49:28,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:49:28,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:49:28,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:49:28,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:49:28,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:49:28,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:49:28,399 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:49:28,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:49:28,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:49:28,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:49:28,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:49:28,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:49:28,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:49:28,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:49:28,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:49:28,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:49:28,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:49:28,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:49:28,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:49:28,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:49:28,401 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:49:28,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:49:28,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:49:28,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:49:28,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:49:28,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:49:28,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:49:28,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:49:28,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:49:28,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:49:28,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:49:28,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:49:28,403 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:49:28,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:49:28,404 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC 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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2024-11-24 00:49:28,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:49:28,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:49:28,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:49:28,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:49:28,786 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:49:28,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-11-24 00:49:32,132 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/eaadc683d/d84ac8b0156f44049c8048ff41c0a002/FLAGd3cab14e0 [2024-11-24 00:49:32,509 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:49:32,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-11-24 00:49:32,528 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/eaadc683d/d84ac8b0156f44049c8048ff41c0a002/FLAGd3cab14e0 [2024-11-24 00:49:32,554 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/eaadc683d/d84ac8b0156f44049c8048ff41c0a002 [2024-11-24 00:49:32,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:49:32,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:49:32,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:49:32,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:49:32,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:49:32,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:32,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42cae5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32, skipping insertion in model container [2024-11-24 00:49:32,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:32,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:49:32,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2024-11-24 00:49:32,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:49:32,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:49:32,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2024-11-24 00:49:32,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:49:32,996 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:49:32,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32 WrapperNode [2024-11-24 00:49:32,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:49:32,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:49:32,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:49:32,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:49:33,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,057 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-24 00:49:33,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:49:33,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:49:33,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:49:33,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:49:33,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,114 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2024-11-24 00:49:33,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:49:33,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:49:33,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:49:33,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:49:33,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (1/1) ... [2024-11-24 00:49:33,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:49:33,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:33,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:49:33,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:49:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:49:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 00:49:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 00:49:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-24 00:49:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-24 00:49:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-24 00:49:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-24 00:49:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-24 00:49:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-24 00:49:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-24 00:49:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-24 00:49:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-24 00:49:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-24 00:49:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-24 00:49:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-24 00:49:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-24 00:49:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-24 00:49:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-24 00:49:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 00:49:33,258 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 00:49:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:49:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 00:49:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-24 00:49:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-24 00:49:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-24 00:49:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:49:33,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:49:33,455 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:49:33,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:49:34,169 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-24 00:49:34,169 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:49:34,186 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:49:34,188 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 00:49:34,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:49:34 BoogieIcfgContainer [2024-11-24 00:49:34,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:49:34,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:49:34,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:49:34,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:49:34,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:49:32" (1/3) ... [2024-11-24 00:49:34,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2615bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:49:34, skipping insertion in model container [2024-11-24 00:49:34,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:49:32" (2/3) ... [2024-11-24 00:49:34,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2615bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:49:34, skipping insertion in model container [2024-11-24 00:49:34,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:49:34" (3/3) ... [2024-11-24 00:49:34,218 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2024-11-24 00:49:34,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:49:34,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-34.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:49:34,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:49:34,340 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;@1bfd928d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:49:34,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:49:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:49:34,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:34,368 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:34,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:34,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1263040471, now seen corresponding path program 1 times [2024-11-24 00:49:34,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506516038] [2024-11-24 00:49:34,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-24 00:49:34,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506516038] [2024-11-24 00:49:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506516038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 00:49:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595691730] [2024-11-24 00:49:34,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:34,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:34,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:49:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 00:49:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-24 00:49:35,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:35,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595691730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:35,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:49:35,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 00:49:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811692420] [2024-11-24 00:49:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:35,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:49:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:35,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:49:35,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:49:35,382 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:35,431 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-24 00:49:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:49:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-24 00:49:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:35,441 INFO L225 Difference]: With dead ends: 233 [2024-11-24 00:49:35,441 INFO L226 Difference]: Without dead ends: 116 [2024-11-24 00:49:35,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:49:35,452 INFO L435 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:35,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-24 00:49:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-24 00:49:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-24 00:49:35,531 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-24 00:49:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:35,532 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-24 00:49:35,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-24 00:49:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:49:35,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:35,536 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:35,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 00:49:35,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:35,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:35,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1556431919, now seen corresponding path program 1 times [2024-11-24 00:49:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:35,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311427001] [2024-11-24 00:49:35,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311427001] [2024-11-24 00:49:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311427001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:49:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242143295] [2024-11-24 00:49:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:36,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:49:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:36,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:49:36,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:36,302 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:36,366 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2024-11-24 00:49:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:49:36,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-24 00:49:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:36,369 INFO L225 Difference]: With dead ends: 231 [2024-11-24 00:49:36,369 INFO L226 Difference]: Without dead ends: 118 [2024-11-24 00:49:36,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:36,371 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:36,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-24 00:49:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-24 00:49:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-24 00:49:36,403 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2024-11-24 00:49:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:36,404 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-24 00:49:36,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-24 00:49:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:49:36,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:36,417 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:36,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:49:36,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:36,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2115253775, now seen corresponding path program 1 times [2024-11-24 00:49:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:36,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737150891] [2024-11-24 00:49:36,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737150891] [2024-11-24 00:49:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737150891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:49:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083205556] [2024-11-24 00:49:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:36,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:49:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:36,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:49:36,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:36,667 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:36,713 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2024-11-24 00:49:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:49:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-24 00:49:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:36,716 INFO L225 Difference]: With dead ends: 234 [2024-11-24 00:49:36,716 INFO L226 Difference]: Without dead ends: 119 [2024-11-24 00:49:36,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:36,720 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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-11-24 00:49:36,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-24 00:49:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-24 00:49:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-24 00:49:36,744 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 171 [2024-11-24 00:49:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:36,745 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-24 00:49:36,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-24 00:49:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:49:36,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:36,751 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:36,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:49:36,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:36,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1362065071, now seen corresponding path program 1 times [2024-11-24 00:49:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950497283] [2024-11-24 00:49:36,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-24 00:49:37,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:37,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950497283] [2024-11-24 00:49:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950497283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 00:49:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642625283] [2024-11-24 00:49:37,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:37,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:37,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:37,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:37,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 00:49:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:37,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:49:37,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:37,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642625283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:37,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:49:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-24 00:49:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186972946] [2024-11-24 00:49:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:37,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:49:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:37,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:49:37,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:37,705 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:37,760 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2024-11-24 00:49:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:49:37,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-24 00:49:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:37,763 INFO L225 Difference]: With dead ends: 237 [2024-11-24 00:49:37,763 INFO L226 Difference]: Without dead ends: 121 [2024-11-24 00:49:37,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:37,766 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:37,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-24 00:49:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-24 00:49:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-24 00:49:37,779 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 171 [2024-11-24 00:49:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:37,780 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-24 00:49:37,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-24 00:49:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-24 00:49:37,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:37,784 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:37,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 00:49:37,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:37,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash -103652351, now seen corresponding path program 1 times [2024-11-24 00:49:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338310175] [2024-11-24 00:49:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338310175] [2024-11-24 00:49:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338310175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:38,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:49:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136034539] [2024-11-24 00:49:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:38,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:49:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:38,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:49:38,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:38,197 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:38,241 INFO L93 Difference]: Finished difference Result 289 states and 415 transitions. [2024-11-24 00:49:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:49:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-11-24 00:49:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:38,245 INFO L225 Difference]: With dead ends: 289 [2024-11-24 00:49:38,246 INFO L226 Difference]: Without dead ends: 171 [2024-11-24 00:49:38,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:38,248 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:38,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-24 00:49:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2024-11-24 00:49:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2024-11-24 00:49:38,272 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 173 [2024-11-24 00:49:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:38,272 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2024-11-24 00:49:38,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2024-11-24 00:49:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-24 00:49:38,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:38,279 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:38,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:49:38,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:38,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash 641310293, now seen corresponding path program 1 times [2024-11-24 00:49:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:38,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545301600] [2024-11-24 00:49:38,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:38,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545301600] [2024-11-24 00:49:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545301600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:38,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:49:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786916994] [2024-11-24 00:49:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:38,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:49:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:38,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:49:38,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:38,468 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:38,504 INFO L93 Difference]: Finished difference Result 278 states and 401 transitions. [2024-11-24 00:49:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:49:38,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-11-24 00:49:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:38,510 INFO L225 Difference]: With dead ends: 278 [2024-11-24 00:49:38,510 INFO L226 Difference]: Without dead ends: 141 [2024-11-24 00:49:38,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:38,512 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:38,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-24 00:49:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-24 00:49:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-24 00:49:38,534 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 176 [2024-11-24 00:49:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:38,536 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-24 00:49:38,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-24 00:49:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-24 00:49:38,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:38,540 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:49:38,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:38,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 54504279, now seen corresponding path program 1 times [2024-11-24 00:49:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920597613] [2024-11-24 00:49:38,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920597613] [2024-11-24 00:49:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920597613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:39,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504017739] [2024-11-24 00:49:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:39,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:39,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:39,616 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-24 00:49:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:40,052 INFO L93 Difference]: Finished difference Result 275 states and 395 transitions. [2024-11-24 00:49:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:49:40,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2024-11-24 00:49:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:40,057 INFO L225 Difference]: With dead ends: 275 [2024-11-24 00:49:40,057 INFO L226 Difference]: Without dead ends: 137 [2024-11-24 00:49:40,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:49:40,059 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 210 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:40,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 380 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 00:49:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-24 00:49:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-24 00:49:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2024-11-24 00:49:40,091 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 176 [2024-11-24 00:49:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2024-11-24 00:49:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-24 00:49:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2024-11-24 00:49:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-24 00:49:40,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:40,097 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:40,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:49:40,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:40,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -154267007, now seen corresponding path program 1 times [2024-11-24 00:49:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871390358] [2024-11-24 00:49:40,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:40,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871390358] [2024-11-24 00:49:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871390358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:41,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:41,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:49:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824552577] [2024-11-24 00:49:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:49:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:41,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:49:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:41,260 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-24 00:49:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:41,731 INFO L93 Difference]: Finished difference Result 265 states and 378 transitions. [2024-11-24 00:49:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2024-11-24 00:49:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:41,734 INFO L225 Difference]: With dead ends: 265 [2024-11-24 00:49:41,734 INFO L226 Difference]: Without dead ends: 133 [2024-11-24 00:49:41,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:49:41,736 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 188 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:41,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 455 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:49:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-24 00:49:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-24 00:49:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2024-11-24 00:49:41,758 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 178 [2024-11-24 00:49:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:41,759 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2024-11-24 00:49:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-24 00:49:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2024-11-24 00:49:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-24 00:49:41,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:41,762 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:49:41,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 731946335, now seen corresponding path program 1 times [2024-11-24 00:49:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412623110] [2024-11-24 00:49:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:41,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412623110] [2024-11-24 00:49:41,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412623110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:41,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:41,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:49:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093403914] [2024-11-24 00:49:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:41,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:49:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:41,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:49:41,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:41,952 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:41,996 INFO L93 Difference]: Finished difference Result 287 states and 406 transitions. [2024-11-24 00:49:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:49:42,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2024-11-24 00:49:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:42,003 INFO L225 Difference]: With dead ends: 287 [2024-11-24 00:49:42,003 INFO L226 Difference]: Without dead ends: 158 [2024-11-24 00:49:42,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:49:42,004 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:42,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 356 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-24 00:49:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2024-11-24 00:49:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2024-11-24 00:49:42,023 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 178 [2024-11-24 00:49:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:42,024 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2024-11-24 00:49:42,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2024-11-24 00:49:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:42,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:42,028 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:49:42,029 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2086298773, now seen corresponding path program 1 times [2024-11-24 00:49:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983154079] [2024-11-24 00:49:42,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:43,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983154079] [2024-11-24 00:49:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983154079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:49:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802616450] [2024-11-24 00:49:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:43,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:49:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:43,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:49:43,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:49:43,485 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:43,842 INFO L93 Difference]: Finished difference Result 398 states and 555 transitions. [2024-11-24 00:49:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:49:43,843 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:43,846 INFO L225 Difference]: With dead ends: 398 [2024-11-24 00:49:43,846 INFO L226 Difference]: Without dead ends: 269 [2024-11-24 00:49:43,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:49:43,847 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 148 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1985 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-24 00:49:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 165. [2024-11-24 00:49:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3) internal successors, (182), 140 states have internal predecessors, (182), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2024-11-24 00:49:43,866 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 180 [2024-11-24 00:49:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:43,867 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2024-11-24 00:49:43,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-24 00:49:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:43,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:43,870 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:49:43,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1385234195, now seen corresponding path program 1 times [2024-11-24 00:49:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349758335] [2024-11-24 00:49:43,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349758335] [2024-11-24 00:49:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349758335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:44,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:49:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690262194] [2024-11-24 00:49:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:44,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:49:44,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:44,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:49:44,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:44,071 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:44,124 INFO L93 Difference]: Finished difference Result 332 states and 460 transitions. [2024-11-24 00:49:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:49:44,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:44,127 INFO L225 Difference]: With dead ends: 332 [2024-11-24 00:49:44,127 INFO L226 Difference]: Without dead ends: 170 [2024-11-24 00:49:44,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:44,128 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:44,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-24 00:49:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-11-24 00:49:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2916666666666667) internal successors, (186), 144 states have internal predecessors, (186), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 232 transitions. [2024-11-24 00:49:44,148 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 232 transitions. Word has length 180 [2024-11-24 00:49:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:44,149 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 232 transitions. [2024-11-24 00:49:44,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 232 transitions. [2024-11-24 00:49:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:44,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:44,154 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:44,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:49:44,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:44,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1972040209, now seen corresponding path program 1 times [2024-11-24 00:49:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059853388] [2024-11-24 00:49:44,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059853388] [2024-11-24 00:49:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059853388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:45,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:45,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:45,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803197485] [2024-11-24 00:49:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:45,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:45,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:45,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:45,476 INFO L87 Difference]: Start difference. First operand 169 states and 232 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:45,743 INFO L93 Difference]: Finished difference Result 443 states and 604 transitions. [2024-11-24 00:49:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:49:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2024-11-24 00:49:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:45,746 INFO L225 Difference]: With dead ends: 443 [2024-11-24 00:49:45,747 INFO L226 Difference]: Without dead ends: 277 [2024-11-24 00:49:45,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:45,748 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 123 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:45,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 518 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-24 00:49:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2024-11-24 00:49:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 240 states have (on average 1.2875) internal successors, (309), 241 states have internal predecessors, (309), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-24 00:49:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 371 transitions. [2024-11-24 00:49:45,775 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 371 transitions. Word has length 180 [2024-11-24 00:49:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:45,776 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 371 transitions. [2024-11-24 00:49:45,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 371 transitions. [2024-11-24 00:49:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:45,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:45,779 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:49:45,780 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:45,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1945750163, now seen corresponding path program 1 times [2024-11-24 00:49:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742376107] [2024-11-24 00:49:45,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742376107] [2024-11-24 00:49:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742376107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:49:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096688198] [2024-11-24 00:49:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:45,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:49:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:45,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:49:45,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:45,994 INFO L87 Difference]: Start difference. First operand 274 states and 371 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:46,039 INFO L93 Difference]: Finished difference Result 514 states and 699 transitions. [2024-11-24 00:49:46,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:49:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:46,043 INFO L225 Difference]: With dead ends: 514 [2024-11-24 00:49:46,043 INFO L226 Difference]: Without dead ends: 243 [2024-11-24 00:49:46,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:46,046 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:46,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-24 00:49:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-11-24 00:49:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-24 00:49:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 329 transitions. [2024-11-24 00:49:46,078 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 329 transitions. Word has length 180 [2024-11-24 00:49:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 329 transitions. [2024-11-24 00:49:46,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 329 transitions. [2024-11-24 00:49:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:46,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:46,082 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:46,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:49:46,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -48812175, now seen corresponding path program 1 times [2024-11-24 00:49:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916253167] [2024-11-24 00:49:46,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:46,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916253167] [2024-11-24 00:49:46,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916253167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:46,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978203680] [2024-11-24 00:49:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:46,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:46,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:46,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:46,718 INFO L87 Difference]: Start difference. First operand 243 states and 329 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:46,962 INFO L93 Difference]: Finished difference Result 578 states and 776 transitions. [2024-11-24 00:49:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:49:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:46,967 INFO L225 Difference]: With dead ends: 578 [2024-11-24 00:49:46,967 INFO L226 Difference]: Without dead ends: 338 [2024-11-24 00:49:46,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:49:46,969 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 53 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:46,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 713 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-24 00:49:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2024-11-24 00:49:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 281 states have (on average 1.2597864768683273) internal successors, (354), 284 states have internal predecessors, (354), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-24 00:49:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 440 transitions. [2024-11-24 00:49:47,024 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 440 transitions. Word has length 180 [2024-11-24 00:49:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:47,025 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 440 transitions. [2024-11-24 00:49:47,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 440 transitions. [2024-11-24 00:49:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:47,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:47,028 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:47,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:49:47,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:47,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1328675853, now seen corresponding path program 1 times [2024-11-24 00:49:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175256309] [2024-11-24 00:49:47,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175256309] [2024-11-24 00:49:48,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175256309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:48,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:48,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937682864] [2024-11-24 00:49:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:48,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:48,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:48,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:48,460 INFO L87 Difference]: Start difference. First operand 329 states and 440 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:48,748 INFO L93 Difference]: Finished difference Result 898 states and 1199 transitions. [2024-11-24 00:49:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:49:48,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2024-11-24 00:49:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:48,753 INFO L225 Difference]: With dead ends: 898 [2024-11-24 00:49:48,754 INFO L226 Difference]: Without dead ends: 572 [2024-11-24 00:49:48,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:48,757 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 123 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:48,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 522 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-24 00:49:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 418. [2024-11-24 00:49:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2756756756756757) internal successors, (472), 373 states have internal predecessors, (472), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-24 00:49:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 558 transitions. [2024-11-24 00:49:48,811 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 558 transitions. Word has length 180 [2024-11-24 00:49:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:48,812 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 558 transitions. [2024-11-24 00:49:48,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 558 transitions. [2024-11-24 00:49:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:48,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:48,817 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:48,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:49:48,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:48,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash -22522129, now seen corresponding path program 1 times [2024-11-24 00:49:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:48,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237309299] [2024-11-24 00:49:48,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237309299] [2024-11-24 00:49:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237309299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:49,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:49,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264820926] [2024-11-24 00:49:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:49,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:49,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:49,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:49,439 INFO L87 Difference]: Start difference. First operand 418 states and 558 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:49,699 INFO L93 Difference]: Finished difference Result 892 states and 1187 transitions. [2024-11-24 00:49:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:49:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:49,704 INFO L225 Difference]: With dead ends: 892 [2024-11-24 00:49:49,704 INFO L226 Difference]: Without dead ends: 477 [2024-11-24 00:49:49,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:49:49,707 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 142 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:49,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 582 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-24 00:49:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 393. [2024-11-24 00:49:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 345 states have (on average 1.2666666666666666) internal successors, (437), 348 states have internal predecessors, (437), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-24 00:49:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 523 transitions. [2024-11-24 00:49:49,755 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 523 transitions. Word has length 180 [2024-11-24 00:49:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 523 transitions. [2024-11-24 00:49:49,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 523 transitions. [2024-11-24 00:49:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:49,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:49,760 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:49,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 00:49:49,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:49,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 57527541, now seen corresponding path program 1 times [2024-11-24 00:49:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:49,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669291289] [2024-11-24 00:49:49,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669291289] [2024-11-24 00:49:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669291289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:50,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:50,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923899586] [2024-11-24 00:49:50,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:50,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:50,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:50,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:50,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:50,335 INFO L87 Difference]: Start difference. First operand 393 states and 523 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:50,613 INFO L93 Difference]: Finished difference Result 832 states and 1101 transitions. [2024-11-24 00:49:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:50,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:50,619 INFO L225 Difference]: With dead ends: 832 [2024-11-24 00:49:50,619 INFO L226 Difference]: Without dead ends: 442 [2024-11-24 00:49:50,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:49:50,621 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 143 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:50,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 733 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-24 00:49:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 288. [2024-11-24 00:49:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 252 states have (on average 1.257936507936508) internal successors, (317), 253 states have internal predecessors, (317), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-24 00:49:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 379 transitions. [2024-11-24 00:49:50,663 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 379 transitions. Word has length 180 [2024-11-24 00:49:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:50,664 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 379 transitions. [2024-11-24 00:49:50,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 379 transitions. [2024-11-24 00:49:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:50,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:50,667 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:50,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 00:49:50,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:50,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1363681265, now seen corresponding path program 1 times [2024-11-24 00:49:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:50,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95980676] [2024-11-24 00:49:50,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95980676] [2024-11-24 00:49:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95980676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615530480] [2024-11-24 00:49:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:51,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:51,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:51,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:51,672 INFO L87 Difference]: Start difference. First operand 288 states and 379 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:51,941 INFO L93 Difference]: Finished difference Result 649 states and 853 transitions. [2024-11-24 00:49:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2024-11-24 00:49:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:51,945 INFO L225 Difference]: With dead ends: 649 [2024-11-24 00:49:51,945 INFO L226 Difference]: Without dead ends: 364 [2024-11-24 00:49:51,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:51,947 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 121 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:51,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 700 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-24 00:49:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 286. [2024-11-24 00:49:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 250 states have (on average 1.248) internal successors, (312), 251 states have internal predecessors, (312), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-24 00:49:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 374 transitions. [2024-11-24 00:49:51,988 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 374 transitions. Word has length 180 [2024-11-24 00:49:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:51,989 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 374 transitions. [2024-11-24 00:49:51,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 374 transitions. [2024-11-24 00:49:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:51,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:51,992 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:51,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 00:49:51,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:51,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash 83817587, now seen corresponding path program 1 times [2024-11-24 00:49:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064569743] [2024-11-24 00:49:51,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064569743] [2024-11-24 00:49:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064569743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:52,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:52,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685995383] [2024-11-24 00:49:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:52,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:52,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:52,939 INFO L87 Difference]: Start difference. First operand 286 states and 374 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:53,211 INFO L93 Difference]: Finished difference Result 574 states and 748 transitions. [2024-11-24 00:49:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:53,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2024-11-24 00:49:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:53,215 INFO L225 Difference]: With dead ends: 574 [2024-11-24 00:49:53,216 INFO L226 Difference]: Without dead ends: 291 [2024-11-24 00:49:53,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:53,217 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 121 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:53,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 710 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-24 00:49:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 241. [2024-11-24 00:49:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 214 states have (on average 1.2476635514018692) internal successors, (267), 214 states have internal predecessors, (267), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 313 transitions. [2024-11-24 00:49:53,252 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 313 transitions. Word has length 180 [2024-11-24 00:49:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:53,254 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 313 transitions. [2024-11-24 00:49:53,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:49:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 313 transitions. [2024-11-24 00:49:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:53,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:53,258 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 00:49:53,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -502988427, now seen corresponding path program 1 times [2024-11-24 00:49:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130164753] [2024-11-24 00:49:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130164753] [2024-11-24 00:49:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130164753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:53,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:53,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:49:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307625010] [2024-11-24 00:49:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:53,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:49:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:53,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:49:53,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:49:53,768 INFO L87 Difference]: Start difference. First operand 241 states and 313 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:53,986 INFO L93 Difference]: Finished difference Result 523 states and 678 transitions. [2024-11-24 00:49:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:49:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:53,990 INFO L225 Difference]: With dead ends: 523 [2024-11-24 00:49:53,990 INFO L226 Difference]: Without dead ends: 285 [2024-11-24 00:49:53,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:49:53,992 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 51 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:53,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 805 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:49:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-24 00:49:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 241. [2024-11-24 00:49:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 214 states have (on average 1.2429906542056075) internal successors, (266), 214 states have internal predecessors, (266), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:49:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 312 transitions. [2024-11-24 00:49:54,031 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 312 transitions. Word has length 180 [2024-11-24 00:49:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:54,032 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 312 transitions. [2024-11-24 00:49:54,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 312 transitions. [2024-11-24 00:49:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:54,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:54,035 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:54,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-24 00:49:54,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:54,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 198076151, now seen corresponding path program 1 times [2024-11-24 00:49:54,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:54,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944653782] [2024-11-24 00:49:54,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:56,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944653782] [2024-11-24 00:49:56,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944653782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:56,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:56,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:49:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007579915] [2024-11-24 00:49:56,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:56,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:49:56,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:56,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:49:56,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:49:56,621 INFO L87 Difference]: Start difference. First operand 241 states and 312 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-24 00:49:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:57,312 INFO L93 Difference]: Finished difference Result 513 states and 665 transitions. [2024-11-24 00:49:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:49:57,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2024-11-24 00:49:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:57,315 INFO L225 Difference]: With dead ends: 513 [2024-11-24 00:49:57,316 INFO L226 Difference]: Without dead ends: 275 [2024-11-24 00:49:57,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:49:57,317 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 58 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:57,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1824 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:49:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-24 00:49:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2024-11-24 00:49:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 240 states have (on average 1.2458333333333333) internal successors, (299), 241 states have internal predecessors, (299), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-24 00:49:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 353 transitions. [2024-11-24 00:49:57,349 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 353 transitions. Word has length 180 [2024-11-24 00:49:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:57,350 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 353 transitions. [2024-11-24 00:49:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-24 00:49:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 353 transitions. [2024-11-24 00:49:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:49:57,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:57,352 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:57,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-24 00:49:57,353 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1887269220, now seen corresponding path program 1 times [2024-11-24 00:49:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:57,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845182953] [2024-11-24 00:49:57,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845182953] [2024-11-24 00:49:57,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845182953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:57,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:49:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273020289] [2024-11-24 00:49:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:49:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:57,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:49:57,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:49:57,573 INFO L87 Difference]: Start difference. First operand 272 states and 353 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:57,874 INFO L93 Difference]: Finished difference Result 720 states and 933 transitions. [2024-11-24 00:49:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:49:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:49:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:57,878 INFO L225 Difference]: With dead ends: 720 [2024-11-24 00:49:57,878 INFO L226 Difference]: Without dead ends: 451 [2024-11-24 00:49:57,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:49:57,881 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 114 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:57,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 422 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:49:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-24 00:49:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 341. [2024-11-24 00:49:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.2190812720848057) internal successors, (345), 284 states have internal predecessors, (345), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:49:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 445 transitions. [2024-11-24 00:49:57,931 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 445 transitions. Word has length 180 [2024-11-24 00:49:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:57,932 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 445 transitions. [2024-11-24 00:49:57,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 445 transitions. [2024-11-24 00:49:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-24 00:49:57,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:57,935 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:57,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 00:49:57,935 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 146621974, now seen corresponding path program 1 times [2024-11-24 00:49:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465151901] [2024-11-24 00:49:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-24 00:49:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:58,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465151901] [2024-11-24 00:49:58,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465151901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 00:49:58,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691479836] [2024-11-24 00:49:58,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:58,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:49:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:49:58,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:49:58,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 00:49:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:58,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:49:58,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:49:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:58,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:49:58,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691479836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:58,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:49:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-24 00:49:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373073499] [2024-11-24 00:49:58,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:58,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:49:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:58,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:49:58,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:49:58,683 INFO L87 Difference]: Start difference. First operand 341 states and 445 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:58,770 INFO L93 Difference]: Finished difference Result 616 states and 803 transitions. [2024-11-24 00:49:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:49:58,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2024-11-24 00:49:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:58,773 INFO L225 Difference]: With dead ends: 616 [2024-11-24 00:49:58,774 INFO L226 Difference]: Without dead ends: 347 [2024-11-24 00:49:58,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:49:58,775 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:58,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:49:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-24 00:49:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-24 00:49:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 289 states have (on average 1.2145328719723183) internal successors, (351), 290 states have internal predecessors, (351), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:49:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 451 transitions. [2024-11-24 00:49:58,835 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 451 transitions. Word has length 182 [2024-11-24 00:49:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:58,836 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 451 transitions. [2024-11-24 00:49:58,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 451 transitions. [2024-11-24 00:49:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 00:49:58,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:58,840 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:58,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 00:49:59,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-24 00:49:59,041 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -462521391, now seen corresponding path program 1 times [2024-11-24 00:49:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725102998] [2024-11-24 00:49:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:49:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:49:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:49:59,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:49:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725102998] [2024-11-24 00:49:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725102998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:49:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:49:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:49:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108548746] [2024-11-24 00:49:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:49:59,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:49:59,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:49:59,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:49:59,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:49:59,644 INFO L87 Difference]: Start difference. First operand 347 states and 451 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:49:59,891 INFO L93 Difference]: Finished difference Result 613 states and 789 transitions. [2024-11-24 00:49:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:49:59,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2024-11-24 00:49:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:49:59,896 INFO L225 Difference]: With dead ends: 613 [2024-11-24 00:49:59,896 INFO L226 Difference]: Without dead ends: 611 [2024-11-24 00:49:59,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:49:59,897 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 91 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:49:59,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1119 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:49:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-24 00:49:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 608. [2024-11-24 00:49:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 527 states have (on average 1.222011385199241) internal successors, (644), 530 states have internal predecessors, (644), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-24 00:49:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 782 transitions. [2024-11-24 00:49:59,956 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 782 transitions. Word has length 184 [2024-11-24 00:49:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:49:59,957 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 782 transitions. [2024-11-24 00:49:59,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:49:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 782 transitions. [2024-11-24 00:49:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 00:49:59,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:49:59,960 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:49:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-24 00:49:59,960 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:49:59,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:49:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1306526893, now seen corresponding path program 1 times [2024-11-24 00:49:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:49:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735623892] [2024-11-24 00:49:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:49:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:50:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:50:00,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:50:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:50:00,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:50:00,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:50:00,222 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 00:50:00,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-24 00:50:00,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:00,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:50:00,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:50:00 BoogieIcfgContainer [2024-11-24 00:50:00,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:50:00,355 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:50:00,355 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:50:00,355 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:50:00,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:49:34" (3/4) ... [2024-11-24 00:50:00,362 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:50:00,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:50:00,363 INFO L158 Benchmark]: Toolchain (without parser) took 27803.83ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 91.8MB in the beginning and 363.3MB in the end (delta: -271.5MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. [2024-11-24 00:50:00,363 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:50:00,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.20ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:50:00,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.40ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:50:00,364 INFO L158 Benchmark]: Boogie Preprocessor took 112.20ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 68.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:50:00,364 INFO L158 Benchmark]: RCFGBuilder took 1017.89ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 38.5MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:50:00,365 INFO L158 Benchmark]: TraceAbstraction took 26162.60ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 38.0MB in the beginning and 367.5MB in the end (delta: -329.6MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2024-11-24 00:50:00,365 INFO L158 Benchmark]: Witness Printer took 7.26ms. Allocated memory is still 545.3MB. Free memory was 367.5MB in the beginning and 363.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:50:00,366 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.42ms. Allocated memory is still 117.4MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.20ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.40ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 112.20ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 68.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.89ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 38.5MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26162.60ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 38.0MB in the beginning and 367.5MB in the end (delta: -329.6MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Witness Printer took 7.26ms. Allocated memory is still 545.3MB. Free memory was 367.5MB in the beginning and 363.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] isInitial = 1 [L107] FCALL initially() [L109] CALL updateLastVariables() [L99] EXPR BOOL_unsigned_char_Array_0[1][1] [L99] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L110] RET updateVariables() [L111] CALL step() [L38] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] EXPR double_Array_0[1] [L43] EXPR double_Array_0[0] [L43] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] COND FALSE !(double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) [L46] EXPR BOOL_unsigned_char_Array_0[0][2] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) [L47] EXPR BOOL_unsigned_char_Array_0[1][2] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] BOOL_unsigned_char_Array_0[1][1] = ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]) [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] signed long int stepLocal_1 = (unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1))); [L52] EXPR signed_char_Array_0[2] [L52] signed char stepLocal_0 = signed_char_Array_0[2]; [L53] COND FALSE !(-10 >= stepLocal_0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) [L102] EXPR BOOL_unsigned_char_Array_0[0][2] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) [L102] EXPR BOOL_unsigned_char_Array_0[1][1] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) [L102] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) [L102] EXPR double_Array_0[1] [L102] EXPR double_Array_0[0] [L102] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 [L102] EXPR signed_char_Array_0[2] [L102] EXPR signed_char_Array_0[4] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102-L103] return (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 25, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1804 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1798 mSDsluCounter, 15460 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11326 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2034 IncrementalHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 4134 mSDtfsCounter, 2034 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=24, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 857 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 4979 NumberOfCodeBlocks, 4979 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4768 ConstructedInterpolants, 0 QuantifiedInterpolants, 7487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1615 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 27148/27324 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:50:00,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC --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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:50:03,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:50:03,380 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 00:50:03,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:50:03,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:50:03,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:50:03,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:50:03,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:50:03,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:50:03,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:50:03,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:50:03,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:50:03,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:50:03,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:50:03,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:50:03,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:50:03,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:50:03,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:50:03,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:50:03,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:50:03,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:50:03,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:50:03,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:50:03,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:50:03,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:50:03,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:50:03,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:50:03,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:50:03,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:50:03,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:50:03,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:50:03,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:50:03,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:50:03,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:50:03,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:50:03,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:50:03,445 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:50:03,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:50:03,446 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:50:03,446 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:50:03,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:50:03,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:50:03,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:50:03,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:50:03,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC 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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2024-11-24 00:50:03,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:50:03,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:50:03,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:50:03,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:50:03,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:50:03,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-11-24 00:50:06,984 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/6fa5fcf8b/dde00b655eaa48e8b997e28fab2d5266/FLAGdff7b201c [2024-11-24 00:50:07,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:50:07,279 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-11-24 00:50:07,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/6fa5fcf8b/dde00b655eaa48e8b997e28fab2d5266/FLAGdff7b201c [2024-11-24 00:50:07,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/data/6fa5fcf8b/dde00b655eaa48e8b997e28fab2d5266 [2024-11-24 00:50:07,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:50:07,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:50:07,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:50:07,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:50:07,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:50:07,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbf3e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07, skipping insertion in model container [2024-11-24 00:50:07,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:50:07,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2024-11-24 00:50:07,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:50:07,614 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:50:07,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2024-11-24 00:50:07,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:50:07,743 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:50:07,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07 WrapperNode [2024-11-24 00:50:07,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:50:07,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:50:07,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:50:07,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:50:07,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,835 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2024-11-24 00:50:07,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:50:07,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:50:07,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:50:07,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:50:07,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,896 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2024-11-24 00:50:07,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:50:07,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:50:07,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:50:07,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:50:07,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (1/1) ... [2024-11-24 00:50:07,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:50:07,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:50:08,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:50:08,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:50:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:50:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-24 00:50:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-24 00:50:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-24 00:50:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-24 00:50:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-24 00:50:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-24 00:50:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-24 00:50:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-24 00:50:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-24 00:50:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-24 00:50:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-24 00:50:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-24 00:50:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-24 00:50:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-24 00:50:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-24 00:50:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:50:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 00:50:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-24 00:50:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-24 00:50:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-24 00:50:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-24 00:50:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-24 00:50:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-24 00:50:08,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 00:50:08,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:50:08,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-24 00:50:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-24 00:50:08,211 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:50:08,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:50:23,247 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-24 00:50:23,247 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:50:23,259 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:50:23,260 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 00:50:23,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:50:23 BoogieIcfgContainer [2024-11-24 00:50:23,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:50:23,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:50:23,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:50:23,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:50:23,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:50:07" (1/3) ... [2024-11-24 00:50:23,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457e43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:50:23, skipping insertion in model container [2024-11-24 00:50:23,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:50:07" (2/3) ... [2024-11-24 00:50:23,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457e43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:50:23, skipping insertion in model container [2024-11-24 00:50:23,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:50:23" (3/3) ... [2024-11-24 00:50:23,271 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2024-11-24 00:50:23,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:50:23,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-34.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:50:23,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:50:23,358 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;@226d915c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:50:23,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:50:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:50:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:50:23,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:23,383 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:23,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:23,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:23,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1263040471, now seen corresponding path program 1 times [2024-11-24 00:50:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026070023] [2024-11-24 00:50:23,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:23,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:23,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:23,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-24 00:50:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:23,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 00:50:23,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-24 00:50:23,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:23,977 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:23,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026070023] [2024-11-24 00:50:23,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026070023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:23,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:50:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924767421] [2024-11-24 00:50:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:50:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:24,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:50:24,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:50:24,012 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:50:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:24,044 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-24 00:50:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:50:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-24 00:50:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:24,052 INFO L225 Difference]: With dead ends: 233 [2024-11-24 00:50:24,052 INFO L226 Difference]: Without dead ends: 116 [2024-11-24 00:50:24,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:50:24,059 INFO L435 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:24,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:50:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-24 00:50:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-24 00:50:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:50:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-24 00:50:24,111 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-24 00:50:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:24,112 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-24 00:50:24,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:50:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-24 00:50:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:50:24,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:24,116 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:24,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 00:50:24,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:24,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:24,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1556431919, now seen corresponding path program 1 times [2024-11-24 00:50:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032725882] [2024-11-24 00:50:24,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:24,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:24,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-24 00:50:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:24,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:50:24,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-24 00:50:24,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:24,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032725882] [2024-11-24 00:50:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032725882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:50:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070472742] [2024-11-24 00:50:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:50:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:24,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:50:24,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:50:24,993 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:50:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:25,140 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2024-11-24 00:50:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:50:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-24 00:50:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:25,143 INFO L225 Difference]: With dead ends: 231 [2024-11-24 00:50:25,143 INFO L226 Difference]: Without dead ends: 118 [2024-11-24 00:50:25,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:50:25,145 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:25,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:50:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-24 00:50:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-24 00:50:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:50:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-24 00:50:25,177 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2024-11-24 00:50:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-24 00:50:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-24 00:50:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-24 00:50:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 00:50:25,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:25,181 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:25,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-24 00:50:25,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:25,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:25,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2115253775, now seen corresponding path program 1 times [2024-11-24 00:50:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480323837] [2024-11-24 00:50:25,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:25,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:25,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:25,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-24 00:50:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:25,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:50:25,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:26,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:26,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480323837] [2024-11-24 00:50:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480323837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:26,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:50:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320987599] [2024-11-24 00:50:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:50:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:26,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:50:26,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:50:26,035 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:26,074 INFO L93 Difference]: Finished difference Result 231 states and 334 transitions. [2024-11-24 00:50:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:50:26,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-24 00:50:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:26,077 INFO L225 Difference]: With dead ends: 231 [2024-11-24 00:50:26,077 INFO L226 Difference]: Without dead ends: 116 [2024-11-24 00:50:26,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:50:26,079 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:26,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:50:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-24 00:50:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-24 00:50:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:50:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-24 00:50:26,090 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 171 [2024-11-24 00:50:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:26,090 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-24 00:50:26,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-24 00:50:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-24 00:50:26,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:26,094 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:26,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-24 00:50:26,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:26,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:26,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash 122928453, now seen corresponding path program 1 times [2024-11-24 00:50:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184142597] [2024-11-24 00:50:26,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:26,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:26,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-24 00:50:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:26,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:50:26,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:26,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:26,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184142597] [2024-11-24 00:50:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184142597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:26,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:50:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649519017] [2024-11-24 00:50:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:26,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:50:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:26,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:50:26,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:50:26,897 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:26,975 INFO L93 Difference]: Finished difference Result 231 states and 332 transitions. [2024-11-24 00:50:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:50:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-11-24 00:50:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:26,977 INFO L225 Difference]: With dead ends: 231 [2024-11-24 00:50:26,977 INFO L226 Difference]: Without dead ends: 118 [2024-11-24 00:50:26,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:50:26,979 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:26,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:50:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-24 00:50:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-24 00:50:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-24 00:50:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-24 00:50:26,989 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 173 [2024-11-24 00:50:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:26,990 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-24 00:50:26,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-24 00:50:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-24 00:50:26,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:26,992 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:27,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-24 00:50:27,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:27,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:27,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1208001257, now seen corresponding path program 1 times [2024-11-24 00:50:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480479143] [2024-11-24 00:50:27,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:27,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:27,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:27,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-24 00:50:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:27,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:50:27,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:27,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-24 00:50:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:29,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:29,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:29,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480479143] [2024-11-24 00:50:29,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480479143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:29,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:29,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:50:29,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590462073] [2024-11-24 00:50:29,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:29,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:50:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:29,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:50:29,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:50:29,099 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:29,583 INFO L93 Difference]: Finished difference Result 350 states and 500 transitions. [2024-11-24 00:50:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:50:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-11-24 00:50:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:29,587 INFO L225 Difference]: With dead ends: 350 [2024-11-24 00:50:29,587 INFO L226 Difference]: Without dead ends: 235 [2024-11-24 00:50:29,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 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-11-24 00:50:29,589 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 107 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:29,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 436 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:50:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-24 00:50:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 195. [2024-11-24 00:50:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 146 states have internal predecessors, (185), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-24 00:50:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-24 00:50:29,615 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 175 [2024-11-24 00:50:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:29,616 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-24 00:50:29,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-24 00:50:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-24 00:50:29,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:29,623 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:29,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-24 00:50:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:29,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:29,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash 432539007, now seen corresponding path program 1 times [2024-11-24 00:50:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040223986] [2024-11-24 00:50:29,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:29,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:29,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:29,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:29,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-24 00:50:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:30,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:50:30,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:30,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:30,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040223986] [2024-11-24 00:50:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040223986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:30,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:50:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943904851] [2024-11-24 00:50:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:30,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:50:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:30,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:50:30,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:50:30,437 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:30,504 INFO L93 Difference]: Finished difference Result 324 states and 462 transitions. [2024-11-24 00:50:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:50:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2024-11-24 00:50:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:30,509 INFO L225 Difference]: With dead ends: 324 [2024-11-24 00:50:30,510 INFO L226 Difference]: Without dead ends: 193 [2024-11-24 00:50:30,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:50:30,513 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:30,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:50:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-24 00:50:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-24 00:50:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-24 00:50:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-11-24 00:50:30,547 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 178 [2024-11-24 00:50:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:30,548 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-11-24 00:50:30,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-11-24 00:50:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:30,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:30,550 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:30,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-24 00:50:30,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:30,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2086298773, now seen corresponding path program 1 times [2024-11-24 00:50:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930570525] [2024-11-24 00:50:30,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:30,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:30,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-24 00:50:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:31,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-24 00:50:31,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:31,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-24 00:50:31,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-24 00:50:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:32,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:32,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930570525] [2024-11-24 00:50:32,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930570525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:32,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:32,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:50:32,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4862690] [2024-11-24 00:50:32,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:32,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:50:32,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:32,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:50:32,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:50:32,132 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:33,751 INFO L93 Difference]: Finished difference Result 469 states and 665 transitions. [2024-11-24 00:50:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:50:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:33,756 INFO L225 Difference]: With dead ends: 469 [2024-11-24 00:50:33,756 INFO L226 Difference]: Without dead ends: 340 [2024-11-24 00:50:33,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-24 00:50:33,758 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 154 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:33,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1918 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 00:50:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-24 00:50:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 232. [2024-11-24 00:50:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 183 states have (on average 1.273224043715847) internal successors, (233), 183 states have internal predecessors, (233), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-24 00:50:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 325 transitions. [2024-11-24 00:50:33,805 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 325 transitions. Word has length 180 [2024-11-24 00:50:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:33,806 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 325 transitions. [2024-11-24 00:50:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 325 transitions. [2024-11-24 00:50:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:33,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:33,814 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:33,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-24 00:50:34,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:34,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:34,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1972040209, now seen corresponding path program 1 times [2024-11-24 00:50:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:34,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552013687] [2024-11-24 00:50:34,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:34,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:34,018 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:34,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-24 00:50:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:34,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 00:50:34,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:34,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:34,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552013687] [2024-11-24 00:50:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552013687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:50:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251813866] [2024-11-24 00:50:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:50:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:34,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:50:34,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:50:34,799 INFO L87 Difference]: Start difference. First operand 232 states and 325 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:35,509 INFO L93 Difference]: Finished difference Result 459 states and 635 transitions. [2024-11-24 00:50:35,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:50:35,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:35,513 INFO L225 Difference]: With dead ends: 459 [2024-11-24 00:50:35,514 INFO L226 Difference]: Without dead ends: 291 [2024-11-24 00:50:35,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:50:35,515 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 54 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:35,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 724 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 00:50:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-24 00:50:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 285. [2024-11-24 00:50:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 228 states have (on average 1.2587719298245614) internal successors, (287), 229 states have internal predecessors, (287), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-24 00:50:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 391 transitions. [2024-11-24 00:50:35,554 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 391 transitions. Word has length 180 [2024-11-24 00:50:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 391 transitions. [2024-11-24 00:50:35,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 391 transitions. [2024-11-24 00:50:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:35,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:35,558 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:35,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-24 00:50:35,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:35,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:35,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:35,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1043063409, now seen corresponding path program 1 times [2024-11-24 00:50:35,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:35,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636930183] [2024-11-24 00:50:35,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:35,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:35,762 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:35,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-24 00:50:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:36,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 00:50:36,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:36,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 00:50:36,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-24 00:50:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2024-11-24 00:50:39,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 00:50:39,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:50:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 87 [2024-11-24 00:50:39,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2024-11-24 00:50:40,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:50:40,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 55 [2024-11-24 00:50:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-24 00:50:40,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:50:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:40,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636930183] [2024-11-24 00:50:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636930183] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:50:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:50:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-11-24 00:50:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452885204] [2024-11-24 00:50:40,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:40,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:50:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:40,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:50:40,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:50:40,902 INFO L87 Difference]: Start difference. First operand 285 states and 391 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:41,370 INFO L93 Difference]: Finished difference Result 647 states and 886 transitions. [2024-11-24 00:50:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:50:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:41,381 INFO L225 Difference]: With dead ends: 647 [2024-11-24 00:50:41,382 INFO L226 Difference]: Without dead ends: 430 [2024-11-24 00:50:41,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-24 00:50:41,383 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 69 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:41,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 548 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:50:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-24 00:50:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 347. [2024-11-24 00:50:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 290 states have (on average 1.2862068965517242) internal successors, (373), 291 states have internal predecessors, (373), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-24 00:50:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 477 transitions. [2024-11-24 00:50:41,437 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 477 transitions. Word has length 180 [2024-11-24 00:50:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:41,442 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 477 transitions. [2024-11-24 00:50:41,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions. [2024-11-24 00:50:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:41,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:41,450 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:41,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-24 00:50:41,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:41,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:41,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -22522129, now seen corresponding path program 1 times [2024-11-24 00:50:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:41,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970997658] [2024-11-24 00:50:41,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:41,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:41,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:41,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-24 00:50:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:42,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 00:50:42,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:42,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:42,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970997658] [2024-11-24 00:50:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970997658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:50:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239858929] [2024-11-24 00:50:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:42,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:50:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:42,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:50:42,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:50:42,356 INFO L87 Difference]: Start difference. First operand 347 states and 477 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:42,975 INFO L93 Difference]: Finished difference Result 645 states and 883 transitions. [2024-11-24 00:50:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:50:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:42,979 INFO L225 Difference]: With dead ends: 645 [2024-11-24 00:50:42,980 INFO L226 Difference]: Without dead ends: 366 [2024-11-24 00:50:42,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:50:42,983 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 79 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:42,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 726 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 00:50:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-24 00:50:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 318. [2024-11-24 00:50:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 261 states have (on average 1.2720306513409962) internal successors, (332), 262 states have internal predecessors, (332), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-24 00:50:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 436 transitions. [2024-11-24 00:50:43,021 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 436 transitions. Word has length 180 [2024-11-24 00:50:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:43,022 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 436 transitions. [2024-11-24 00:50:43,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 436 transitions. [2024-11-24 00:50:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:43,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:43,028 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:43,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-24 00:50:43,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:43,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:43,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1865700493, now seen corresponding path program 1 times [2024-11-24 00:50:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262303379] [2024-11-24 00:50:43,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:43,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:43,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:43,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-24 00:50:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:43,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 00:50:43,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:43,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 00:50:44,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2024-11-24 00:50:44,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 00:50:44,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 69 [2024-11-24 00:50:44,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2024-11-24 00:50:45,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:50:45,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 47 [2024-11-24 00:50:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-24 00:50:45,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:50:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:46,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262303379] [2024-11-24 00:50:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262303379] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:50:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:50:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-24 00:50:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643465566] [2024-11-24 00:50:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:50:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:50:46,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:50:46,279 INFO L87 Difference]: Start difference. First operand 318 states and 436 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:46,791 INFO L93 Difference]: Finished difference Result 717 states and 976 transitions. [2024-11-24 00:50:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:50:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:46,796 INFO L225 Difference]: With dead ends: 717 [2024-11-24 00:50:46,796 INFO L226 Difference]: Without dead ends: 467 [2024-11-24 00:50:46,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:50:46,798 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 70 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:46,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 573 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:50:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-24 00:50:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 462. [2024-11-24 00:50:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 388 states have (on average 1.2731958762886597) internal successors, (494), 391 states have internal predecessors, (494), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-24 00:50:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 626 transitions. [2024-11-24 00:50:46,847 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 626 transitions. Word has length 180 [2024-11-24 00:50:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:46,847 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 626 transitions. [2024-11-24 00:50:46,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 626 transitions. [2024-11-24 00:50:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:46,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:46,850 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:46,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-24 00:50:47,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:47,051 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash 57527541, now seen corresponding path program 1 times [2024-11-24 00:50:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050822579] [2024-11-24 00:50:47,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:47,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:47,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:47,055 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:47,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-24 00:50:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:47,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 00:50:47,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:47,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:47,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050822579] [2024-11-24 00:50:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050822579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:50:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335430405] [2024-11-24 00:50:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:50:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:47,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:50:47,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:50:47,763 INFO L87 Difference]: Start difference. First operand 462 states and 626 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:48,459 INFO L93 Difference]: Finished difference Result 901 states and 1213 transitions. [2024-11-24 00:50:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:50:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:48,465 INFO L225 Difference]: With dead ends: 901 [2024-11-24 00:50:48,465 INFO L226 Difference]: Without dead ends: 511 [2024-11-24 00:50:48,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:50:48,467 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 79 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:48,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 922 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 00:50:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-24 00:50:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 357. [2024-11-24 00:50:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 296 states have internal predecessors, (372), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-24 00:50:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2024-11-24 00:50:48,506 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 180 [2024-11-24 00:50:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2024-11-24 00:50:48,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2024-11-24 00:50:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:48,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:48,512 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:48,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-24 00:50:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:48,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1363681265, now seen corresponding path program 1 times [2024-11-24 00:50:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460182041] [2024-11-24 00:50:48,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:48,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:48,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:48,715 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:48,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-24 00:50:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:49,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 00:50:49,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:49,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 00:50:49,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 00:50:50,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-24 00:50:50,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 00:50:50,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2024-11-24 00:50:50,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-24 00:50:50,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:50:50,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2024-11-24 00:50:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-24 00:50:50,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:50:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:51,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460182041] [2024-11-24 00:50:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460182041] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:50:51,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:50:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-24 00:50:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845736862] [2024-11-24 00:50:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:50:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:51,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:50:51,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:50:51,493 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:51,949 INFO L93 Difference]: Finished difference Result 718 states and 963 transitions. [2024-11-24 00:50:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:50:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:51,954 INFO L225 Difference]: With dead ends: 718 [2024-11-24 00:50:51,954 INFO L226 Difference]: Without dead ends: 433 [2024-11-24 00:50:51,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:50:51,956 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 123 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:51,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 541 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:50:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-24 00:50:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 355. [2024-11-24 00:50:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 293 states have (on average 1.2525597269624573) internal successors, (367), 294 states have internal predecessors, (367), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-24 00:50:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 475 transitions. [2024-11-24 00:50:51,985 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 475 transitions. Word has length 180 [2024-11-24 00:50:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:51,986 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 475 transitions. [2024-11-24 00:50:51,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 475 transitions. [2024-11-24 00:50:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:51,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:51,989 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:52,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-24 00:50:52,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:52,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:52,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash 83817587, now seen corresponding path program 1 times [2024-11-24 00:50:52,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346723808] [2024-11-24 00:50:52,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:52,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:52,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:52,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-24 00:50:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:52,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 00:50:52,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:52,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 00:50:53,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-24 00:50:53,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 00:50:53,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2024-11-24 00:50:53,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 00:50:53,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2024-11-24 00:50:54,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:50:54,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2024-11-24 00:50:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-24 00:50:54,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:50:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:54,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346723808] [2024-11-24 00:50:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346723808] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:50:54,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:50:54,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-24 00:50:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123113677] [2024-11-24 00:50:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:54,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:50:54,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:54,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:50:54,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:50:54,984 INFO L87 Difference]: Start difference. First operand 355 states and 475 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:55,387 INFO L93 Difference]: Finished difference Result 643 states and 858 transitions. [2024-11-24 00:50:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:50:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:55,390 INFO L225 Difference]: With dead ends: 643 [2024-11-24 00:50:55,390 INFO L226 Difference]: Without dead ends: 360 [2024-11-24 00:50:55,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:50:55,392 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 123 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:55,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 549 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 00:50:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-24 00:50:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 310. [2024-11-24 00:50:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 257 states have (on average 1.2529182879377432) internal successors, (322), 257 states have internal predecessors, (322), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-24 00:50:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 414 transitions. [2024-11-24 00:50:55,414 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 414 transitions. Word has length 180 [2024-11-24 00:50:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:55,415 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 414 transitions. [2024-11-24 00:50:55,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 414 transitions. [2024-11-24 00:50:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:55,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:55,417 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:55,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-24 00:50:55,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:55,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -502988427, now seen corresponding path program 1 times [2024-11-24 00:50:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349351466] [2024-11-24 00:50:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:55,621 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:55,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-24 00:50:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:56,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 00:50:56,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:50:56,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:50:56,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:50:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349351466] [2024-11-24 00:50:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349351466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:50:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:50:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:50:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835774375] [2024-11-24 00:50:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:50:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:50:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:50:56,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:50:56,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:50:56,304 INFO L87 Difference]: Start difference. First operand 310 states and 414 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:50:56,850 INFO L93 Difference]: Finished difference Result 592 states and 788 transitions. [2024-11-24 00:50:56,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:50:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:50:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:50:56,853 INFO L225 Difference]: With dead ends: 592 [2024-11-24 00:50:56,854 INFO L226 Difference]: Without dead ends: 354 [2024-11-24 00:50:56,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:50:56,855 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 51 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:50:56,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 834 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 00:50:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-24 00:50:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 310. [2024-11-24 00:50:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 257 states have internal predecessors, (321), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-24 00:50:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 413 transitions. [2024-11-24 00:50:56,878 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 413 transitions. Word has length 180 [2024-11-24 00:50:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:50:56,878 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 413 transitions. [2024-11-24 00:50:56,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:50:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 413 transitions. [2024-11-24 00:50:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-24 00:50:56,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:50:56,880 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:50:56,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-24 00:50:57,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:57,081 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:50:57,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:50:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 198076151, now seen corresponding path program 1 times [2024-11-24 00:50:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:50:57,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316609760] [2024-11-24 00:50:57,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:50:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:50:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:50:57,084 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:50:57,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-24 00:50:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:50:57,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-24 00:50:57,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:50:57,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 00:50:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-24 00:50:58,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:50:58,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-24 00:51:01,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:51:01,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-11-24 00:51:02,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:51:02,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2024-11-24 00:51:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-24 00:51:02,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:51:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:51:03,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316609760] [2024-11-24 00:51:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316609760] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:51:03,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:51:03,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 23 [2024-11-24 00:51:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132476676] [2024-11-24 00:51:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:03,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:51:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:03,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:51:03,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-24 00:51:03,867 INFO L87 Difference]: Start difference. First operand 310 states and 413 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:51:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:51:05,539 INFO L93 Difference]: Finished difference Result 582 states and 775 transitions. [2024-11-24 00:51:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:51:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-24 00:51:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:51:05,543 INFO L225 Difference]: With dead ends: 582 [2024-11-24 00:51:05,543 INFO L226 Difference]: Without dead ends: 344 [2024-11-24 00:51:05,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-11-24 00:51:05,546 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 59 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:51:05,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1515 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 00:51:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-24 00:51:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2024-11-24 00:51:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 284 states have internal predecessors, (354), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:51:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 454 transitions. [2024-11-24 00:51:05,573 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 454 transitions. Word has length 180 [2024-11-24 00:51:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:51:05,573 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 454 transitions. [2024-11-24 00:51:05,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:51:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 454 transitions. [2024-11-24 00:51:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-24 00:51:05,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:51:05,576 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:05,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-24 00:51:05,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:51:05,778 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:51:05,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash 146621974, now seen corresponding path program 1 times [2024-11-24 00:51:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:05,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609753028] [2024-11-24 00:51:05,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:51:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:51:05,783 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:51:05,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-24 00:51:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:06,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:51:06,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:51:06,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:06,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:06,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609753028] [2024-11-24 00:51:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609753028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:51:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256830521] [2024-11-24 00:51:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:51:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:06,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:51:06,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:51:06,347 INFO L87 Difference]: Start difference. First operand 341 states and 454 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:51:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:51:06,444 INFO L93 Difference]: Finished difference Result 616 states and 821 transitions. [2024-11-24 00:51:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:51:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2024-11-24 00:51:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:51:06,447 INFO L225 Difference]: With dead ends: 616 [2024-11-24 00:51:06,447 INFO L226 Difference]: Without dead ends: 347 [2024-11-24 00:51:06,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:51:06,448 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:51:06,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:51:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-24 00:51:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-24 00:51:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 289 states have (on average 1.245674740484429) internal successors, (360), 290 states have internal predecessors, (360), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:51:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 460 transitions. [2024-11-24 00:51:06,481 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 460 transitions. Word has length 182 [2024-11-24 00:51:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:51:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 460 transitions. [2024-11-24 00:51:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:51:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 460 transitions. [2024-11-24 00:51:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 00:51:06,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:51:06,484 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:06,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-24 00:51:06,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:51:06,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:51:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -462521391, now seen corresponding path program 1 times [2024-11-24 00:51:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731996536] [2024-11-24 00:51:06,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:06,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:51:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:51:06,692 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:51:06,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-24 00:51:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:07,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-24 00:51:07,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:07,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 00:51:08,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-11-24 00:51:09,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 00:51:09,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 40 [2024-11-24 00:51:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-24 00:51:09,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:51:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-24 00:51:10,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731996536] [2024-11-24 00:51:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731996536] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:51:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:51:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 19 [2024-11-24 00:51:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880933574] [2024-11-24 00:51:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:51:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:10,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:51:10,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-24 00:51:10,768 INFO L87 Difference]: Start difference. First operand 347 states and 460 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:51:13,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 00:51:17,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 00:51:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:51:17,813 INFO L93 Difference]: Finished difference Result 613 states and 806 transitions. [2024-11-24 00:51:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:51:17,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2024-11-24 00:51:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:51:17,817 INFO L225 Difference]: With dead ends: 613 [2024-11-24 00:51:17,817 INFO L226 Difference]: Without dead ends: 611 [2024-11-24 00:51:17,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-24 00:51:17,819 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 92 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-24 00:51:17,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1131 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-24 00:51:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-24 00:51:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 608. [2024-11-24 00:51:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 527 states have (on average 1.25426944971537) internal successors, (661), 530 states have internal predecessors, (661), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-24 00:51:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 799 transitions. [2024-11-24 00:51:17,871 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 799 transitions. Word has length 184 [2024-11-24 00:51:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:51:17,872 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 799 transitions. [2024-11-24 00:51:17,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-24 00:51:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 799 transitions. [2024-11-24 00:51:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-24 00:51:17,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:51:17,874 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:17,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-24 00:51:18,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:51:18,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:51:18,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1306526893, now seen corresponding path program 1 times [2024-11-24 00:51:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165177704] [2024-11-24 00:51:18,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:18,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 00:51:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:51:18,078 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 00:51:18,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2c6fed3-aa57-4b81-918c-7bfa35a6b856/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process