./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:35,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:35,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:08:35,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:35,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:35,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:35,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:35,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:35,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:35,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:35,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:35,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:35,703 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:35,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:35,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:08:35,705 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:35,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:08:35,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:35,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:35,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:08:35,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:35,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:08:35,709 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:35,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:08:35,710 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:35,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:35,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:35,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:35,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:35,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:35,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:35,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:08:35,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:08:35,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:08:35,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:35,714 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:08:35,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:35,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:35,715 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:35,715 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2023-11-06 23:08:36,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:36,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:36,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:36,051 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:36,051 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:36,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-06 23:08:39,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:39,691 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:39,692 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-06 23:08:39,706 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/data/876641560/702fb87092654878bbed3fe32be0a665/FLAGee25650fc [2023-11-06 23:08:39,730 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/data/876641560/702fb87092654878bbed3fe32be0a665 [2023-11-06 23:08:39,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:39,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:39,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:39,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:39,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:39,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:39" (1/1) ... [2023-11-06 23:08:39,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c216aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:39, skipping insertion in model container [2023-11-06 23:08:39,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:39" (1/1) ... [2023-11-06 23:08:39,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:39,963 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2023-11-06 23:08:40,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:40,014 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:40,032 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2023-11-06 23:08:40,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:40,074 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:40,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40 WrapperNode [2023-11-06 23:08:40,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:40,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:40,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:40,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:40,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,154 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2023-11-06 23:08:40,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:40,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:40,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:40,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:40,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:40,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:40,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:40,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:40,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (1/1) ... [2023-11-06 23:08:40,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:40,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:08:40,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:08:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:08:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:40,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:40,427 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:40,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:08:40,842 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:08:40,849 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:08:40,850 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:08:40,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:40 BoogieIcfgContainer [2023-11-06 23:08:40,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:08:40,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:08:40,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:08:40,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:08:40,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:39" (1/3) ... [2023-11-06 23:08:40,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39beeab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:40, skipping insertion in model container [2023-11-06 23:08:40,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:40" (2/3) ... [2023-11-06 23:08:40,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39beeab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:40, skipping insertion in model container [2023-11-06 23:08:40,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:40" (3/3) ... [2023-11-06 23:08:40,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-06 23:08:40,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:08:40,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:08:40,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:08:40,982 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@434910fe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:08:40,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:08:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 23:08:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 23:08:41,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:41,005 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:41,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:41,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1832970245, now seen corresponding path program 1 times [2023-11-06 23:08:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:41,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238203758] [2023-11-06 23:08:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238203758] [2023-11-06 23:08:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238203758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:41,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:41,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365933232] [2023-11-06 23:08:41,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:08:41,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:08:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:08:41,601 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 23:08:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:41,637 INFO L93 Difference]: Finished difference Result 107 states and 184 transitions. [2023-11-06 23:08:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:08:41,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2023-11-06 23:08:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:41,650 INFO L225 Difference]: With dead ends: 107 [2023-11-06 23:08:41,650 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 23:08:41,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:08:41,660 INFO L413 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:41,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 23:08:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 23:08:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 23:08:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2023-11-06 23:08:41,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 116 [2023-11-06 23:08:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:41,718 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-11-06 23:08:41,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 23:08:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2023-11-06 23:08:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 23:08:41,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:41,723 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:41,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:08:41,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:41,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1302568635, now seen corresponding path program 1 times [2023-11-06 23:08:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:41,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128449155] [2023-11-06 23:08:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:42,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:43,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:43,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128449155] [2023-11-06 23:08:43,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128449155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:43,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:43,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841307153] [2023-11-06 23:08:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:43,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:43,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:43,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:43,196 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:43,517 INFO L93 Difference]: Finished difference Result 154 states and 232 transitions. [2023-11-06 23:08:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2023-11-06 23:08:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:43,525 INFO L225 Difference]: With dead ends: 154 [2023-11-06 23:08:43,525 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 23:08:43,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:43,532 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:43,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 207 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:08:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 23:08:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2023-11-06 23:08:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2023-11-06 23:08:43,609 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 116 [2023-11-06 23:08:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:43,613 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2023-11-06 23:08:43,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2023-11-06 23:08:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:08:43,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:43,623 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:43,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:08:43,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:43,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1219608240, now seen corresponding path program 1 times [2023-11-06 23:08:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749189407] [2023-11-06 23:08:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:43,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749189407] [2023-11-06 23:08:43,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749189407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:43,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:43,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059105298] [2023-11-06 23:08:43,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:43,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:43,914 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:43,975 INFO L93 Difference]: Finished difference Result 170 states and 257 transitions. [2023-11-06 23:08:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:43,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-06 23:08:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:43,979 INFO L225 Difference]: With dead ends: 170 [2023-11-06 23:08:43,981 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 23:08:43,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:43,985 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:43,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 23:08:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2023-11-06 23:08:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 173 transitions. [2023-11-06 23:08:44,035 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 173 transitions. Word has length 118 [2023-11-06 23:08:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:44,036 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 173 transitions. [2023-11-06 23:08:44,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 173 transitions. [2023-11-06 23:08:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:08:44,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:44,041 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:44,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:08:44,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:44,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1221455282, now seen corresponding path program 1 times [2023-11-06 23:08:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:44,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521665961] [2023-11-06 23:08:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521665961] [2023-11-06 23:08:44,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521665961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733771656] [2023-11-06 23:08:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:44,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:44,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:44,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:44,373 INFO L87 Difference]: Start difference. First operand 113 states and 173 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:44,553 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2023-11-06 23:08:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:44,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-06 23:08:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:44,561 INFO L225 Difference]: With dead ends: 180 [2023-11-06 23:08:44,561 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 23:08:44,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:44,572 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:44,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 23:08:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-11-06 23:08:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2023-11-06 23:08:44,624 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 118 [2023-11-06 23:08:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:44,625 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2023-11-06 23:08:44,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2023-11-06 23:08:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:08:44,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:44,629 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:44,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:08:44,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:44,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1806414254, now seen corresponding path program 1 times [2023-11-06 23:08:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:44,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829686346] [2023-11-06 23:08:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:45,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829686346] [2023-11-06 23:08:45,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829686346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:45,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:45,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406118362] [2023-11-06 23:08:45,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:45,150 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:45,483 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2023-11-06 23:08:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:08:45,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-06 23:08:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:45,487 INFO L225 Difference]: With dead ends: 212 [2023-11-06 23:08:45,487 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 23:08:45,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:08:45,492 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 103 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:45,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 335 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:08:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 23:08:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 107. [2023-11-06 23:08:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 161 transitions. [2023-11-06 23:08:45,544 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 161 transitions. Word has length 118 [2023-11-06 23:08:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:45,546 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 161 transitions. [2023-11-06 23:08:45,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 161 transitions. [2023-11-06 23:08:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:08:45,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:45,549 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:45,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:08:45,549 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:45,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1105349676, now seen corresponding path program 1 times [2023-11-06 23:08:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:45,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529291564] [2023-11-06 23:08:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529291564] [2023-11-06 23:08:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529291564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:08:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613505268] [2023-11-06 23:08:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:51,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:08:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:08:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:08:51,158 INFO L87 Difference]: Start difference. First operand 107 states and 161 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:54,196 INFO L93 Difference]: Finished difference Result 173 states and 259 transitions. [2023-11-06 23:08:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:08:54,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-06 23:08:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:54,200 INFO L225 Difference]: With dead ends: 173 [2023-11-06 23:08:54,200 INFO L226 Difference]: Without dead ends: 171 [2023-11-06 23:08:54,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:08:54,201 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 91 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:54,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 613 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:08:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-06 23:08:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 123. [2023-11-06 23:08:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:08:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2023-11-06 23:08:54,254 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 118 [2023-11-06 23:08:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:54,255 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2023-11-06 23:08:54,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2023-11-06 23:08:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:08:54,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:54,257 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:54,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:08:54,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:54,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1914696302, now seen corresponding path program 1 times [2023-11-06 23:08:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491700837] [2023-11-06 23:08:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:08:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:08:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:08:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:08:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:08:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:08:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:08:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:08:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:08:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:08:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:08:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:08:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:08:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:08:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:08:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:08:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:08:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 23:08:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:57,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491700837] [2023-11-06 23:08:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491700837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:57,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:57,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:08:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872587058] [2023-11-06 23:08:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:08:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:08:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:08:57,863 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:59,559 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2023-11-06 23:08:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:08:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-06 23:08:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:59,561 INFO L225 Difference]: With dead ends: 171 [2023-11-06 23:08:59,561 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:08:59,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:08:59,564 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:59,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 562 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:08:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:08:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:08:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:08:59,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-11-06 23:08:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:59,566 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:08:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 23:08:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:08:59,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:08:59,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:08:59,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:08:59,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:09:01,333 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-11-06 23:09:01,334 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 23:09:01,335 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 23:09:01,338 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse2 (< (+ (* (div ~var_1_12~0 4294967296) 4294967296) ~var_1_8~0) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_12~0)))) (and (= ~var_1_1~0 ~var_1_7~0) (or (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (and (or (< ~var_1_9~0 ~var_1_7~0) (let ((.cse0 (* (div ~var_1_9~0 256) 256))) (and (or (= (+ .cse0 256 ~var_1_8~0) ~var_1_9~0) (< ~var_1_9~0 (+ .cse0 128))) (or (< (+ .cse0 127) ~var_1_9~0) (= (+ .cse0 ~var_1_8~0) ~var_1_9~0))))) (or (let ((.cse1 (* (div ~var_1_7~0 256) 256))) (and (or (< (+ 127 .cse1) ~var_1_7~0) (= (+ ~var_1_8~0 .cse1) ~var_1_7~0)) (or (= (+ 256 ~var_1_8~0 .cse1) ~var_1_7~0) (< ~var_1_7~0 (+ 128 .cse1))))) (< ~var_1_7~0 (+ ~var_1_9~0 1))))) (or (< ~var_1_8~0 0) (= ~var_1_8~0 ~var_1_14~0) .cse2) (or (= (+ ~var_1_8~0 ~var_1_14~0) 0) (< 0 (+ ~var_1_8~0 1)) .cse2))) [2023-11-06 23:09:01,342 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-11-06 23:09:01,342 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-11-06 23:09:01,342 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-06 23:09:01,343 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse0 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)))) (or (let ((.cse3 (< (+ (* (div ~var_1_12~0 4294967296) 4294967296) ~var_1_8~0) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_12~0)))) (and (= ~var_1_1~0 ~var_1_7~0) (or .cse0 (and (or (< ~var_1_9~0 ~var_1_7~0) (let ((.cse1 (* (div ~var_1_9~0 256) 256))) (and (or (= (+ .cse1 256 ~var_1_8~0) ~var_1_9~0) (< ~var_1_9~0 (+ .cse1 128))) (or (< (+ .cse1 127) ~var_1_9~0) (= (+ .cse1 ~var_1_8~0) ~var_1_9~0))))) (or (let ((.cse2 (* (div ~var_1_7~0 256) 256))) (and (or (< (+ 127 .cse2) ~var_1_7~0) (= (+ ~var_1_8~0 .cse2) ~var_1_7~0)) (or (= (+ 256 ~var_1_8~0 .cse2) ~var_1_7~0) (< ~var_1_7~0 (+ 128 .cse2))))) (< ~var_1_7~0 (+ ~var_1_9~0 1))))) (or (< ~var_1_8~0 0) (= ~var_1_8~0 ~var_1_14~0) .cse3) (or (= (+ ~var_1_8~0 ~var_1_14~0) 0) (< 0 (+ ~var_1_8~0 1)) .cse3))) (and .cse0 (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= ~last_1_var_1_18~0 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0)))) [2023-11-06 23:09:01,344 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-11-06 23:09:01,344 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-11-06 23:09:01,345 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 107 118) the Hoare annotation is: false [2023-11-06 23:09:01,345 INFO L899 garLoopResultBuilder]: For program point L44-4(lines 44 52) no Hoare annotation was computed. [2023-11-06 23:09:01,345 INFO L899 garLoopResultBuilder]: For program point L44-5(lines 43 68) no Hoare annotation was computed. [2023-11-06 23:09:01,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:09:01,346 INFO L902 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: true [2023-11-06 23:09:01,346 INFO L902 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: true [2023-11-06 23:09:01,346 INFO L899 garLoopResultBuilder]: For program point L53-1(lines 43 68) no Hoare annotation was computed. [2023-11-06 23:09:01,346 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-06 23:09:01,346 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-11-06 23:09:01,347 INFO L902 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: true [2023-11-06 23:09:01,347 INFO L902 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: true [2023-11-06 23:09:01,347 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-06 23:09:01,347 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:09:01,347 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-11-06 23:09:01,348 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= ~last_1_var_1_18~0 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0))) [2023-11-06 23:09:01,348 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= ~last_1_var_1_18~0 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0))) [2023-11-06 23:09:01,348 INFO L899 garLoopResultBuilder]: For program point L104-2(line 104) no Hoare annotation was computed. [2023-11-06 23:09:01,349 INFO L899 garLoopResultBuilder]: For program point L104-4(line 104) no Hoare annotation was computed. [2023-11-06 23:09:01,350 INFO L899 garLoopResultBuilder]: For program point L96(lines 69 97) no Hoare annotation was computed. [2023-11-06 23:09:01,350 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 67) no Hoare annotation was computed. [2023-11-06 23:09:01,350 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-11-06 23:09:01,350 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-11-06 23:09:01,351 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-06 23:09:01,351 INFO L902 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: true [2023-11-06 23:09:01,351 INFO L902 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: true [2023-11-06 23:09:01,351 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 58) no Hoare annotation was computed. [2023-11-06 23:09:01,351 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-06 23:09:01,352 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 102) no Hoare annotation was computed. [2023-11-06 23:09:01,352 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:09:01,352 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-06 23:09:01,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 23:09:01,353 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 103 106) the Hoare annotation is: (let ((.cse24 (* (div ~var_1_12~0 4294967296) 4294967296))) (let ((.cse10 (+ ~var_1_8~0 1)) (.cse25 (< (+ .cse24 ~var_1_8~0) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_12~0)))) (let ((.cse0 (= ~var_1_1~0 ~var_1_7~0)) (.cse1 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse3 (= ~var_1_18~0 ~var_1_19~0)) (.cse4 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256))) (.cse5 (let ((.cse26 (* (div ~var_1_9~0 256) 256))) (and (or (= (+ .cse26 256 ~var_1_8~0) ~var_1_9~0) (< ~var_1_9~0 (+ .cse26 128))) (or (< (+ .cse26 127) ~var_1_9~0) (= (+ .cse26 ~var_1_8~0) ~var_1_9~0))))) (.cse9 (= ~var_1_9~0 ~var_1_7~0)) (.cse8 (* (div ~var_1_10~0 4294967296) 4294967296)) (.cse2 (+ ~var_1_13~0 ~var_1_10~0)) (.cse11 (or (< ~var_1_8~0 0) (= ~var_1_8~0 ~var_1_14~0) .cse25)) (.cse12 (or (= (+ ~var_1_8~0 ~var_1_14~0) 0) (< 0 .cse10) .cse25)) (.cse13 (= 2 ~var_1_15~0)) (.cse14 (= ~var_1_17~0 ~var_1_16~0)) (.cse7 (* 4294967295 ~var_1_13~0))) (or (and .cse0 .cse1 (<= ~var_1_11~0 .cse2) .cse3 (or .cse4 (and (or (< ~var_1_9~0 ~var_1_7~0) .cse5) (or (let ((.cse6 (* (div ~var_1_7~0 256) 256))) (and (or (< (+ 127 .cse6) ~var_1_7~0) (= (+ ~var_1_8~0 .cse6) ~var_1_7~0)) (or (= (+ 256 ~var_1_8~0 .cse6) ~var_1_7~0) (< ~var_1_7~0 (+ 128 .cse6))))) (< ~var_1_7~0 (+ ~var_1_9~0 1))))) (= (+ (* (div (+ .cse7 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0) (+ .cse8 .cse7 ~var_1_11~0)) (or (not .cse9) (< ~var_1_1~0 .cse10)) .cse11 .cse12 .cse13 .cse14) (let ((.cse22 (+ .cse24 ~var_1_13~0)) (.cse21 (+ .cse24 ~var_1_13~0 1)) (.cse20 (+ (* (div ~var_1_13~0 4294967296) 4294967296) ~var_1_12~0)) (.cse16 (* 4294967295 ~var_1_12~0))) (let ((.cse17 (+ ~var_1_10~0 (* 4294967296 (div (+ ~var_1_11~0 .cse16 1) 4294967296)))) (.cse18 (+ (* 4294967296 (div (+ .cse7 ~var_1_11~0 1) 4294967296)) ~var_1_10~0)) (.cse15 (<= .cse21 .cse20)) (.cse19 (<= .cse20 .cse22))) (and (or (and .cse15 (<= (+ .cse8 ~var_1_11~0 .cse16 1) .cse17)) (and (<= (+ .cse8 .cse7 ~var_1_11~0 1) .cse18) .cse19)) .cse0 .cse1 (or (< .cse20 .cse21) (< .cse17 (+ .cse8 2 ~var_1_11~0 .cse16))) .cse3 (or .cse4 .cse5) (<= .cse10 ~var_1_9~0) .cse9 (or (< .cse22 .cse20) (< .cse18 (+ .cse8 .cse7 2 ~var_1_11~0))) (let ((.cse23 (+ ~var_1_11~0 1))) (or (and .cse15 (<= .cse23 (+ ~var_1_12~0 ~var_1_10~0))) (and (<= .cse23 .cse2) .cse19))) .cse11 .cse12 .cse13 .cse14))))))) [2023-11-06 23:09:01,354 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= ~last_1_var_1_18~0 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0))) [2023-11-06 23:09:01,354 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 42) no Hoare annotation was computed. [2023-11-06 23:09:01,354 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= ~last_1_var_1_18~0 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0))) [2023-11-06 23:09:01,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:09:01,355 INFO L902 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: true [2023-11-06 23:09:01,355 INFO L902 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: true [2023-11-06 23:09:01,355 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 23:09:01,355 INFO L902 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: true [2023-11-06 23:09:01,355 INFO L902 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: true [2023-11-06 23:09:01,356 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-06 23:09:01,356 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 68) no Hoare annotation was computed. [2023-11-06 23:09:01,356 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 23:09:01,356 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 23:09:01,356 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 23:09:01,357 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 23:09:01,361 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:01,364 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:09:01,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:09:01 BoogieIcfgContainer [2023-11-06 23:09:01,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:09:01,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:09:01,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:09:01,445 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:09:01,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:40" (3/4) ... [2023-11-06 23:09:01,449 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:09:01,456 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 23:09:01,468 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 23:09:01,468 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:09:01,469 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:09:01,470 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:09:01,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((var_1_1 == var_1_7) && (1 <= \result)) && (var_1_11 <= (var_1_13 + var_1_10))) && (var_1_18 == var_1_19)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11))) && (!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1)))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16)) || ((((((((((((((((((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1) <= (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) && ((((((var_1_10 / 4294967296) * 4294967296) + var_1_11) + (4294967295 * var_1_12)) + 1) <= (var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))))) || (((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11) + 1) <= ((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10)) && ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) <= (((var_1_12 / 4294967296) * 4294967296) + var_1_13)))) && (var_1_1 == var_1_7)) && (1 <= \result)) && (((((var_1_13 / 4294967296) * 4294967296) + var_1_12) < ((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1)) || ((var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))) < (((((var_1_10 / 4294967296) * 4294967296) + 2) + var_1_11) + (4294967295 * var_1_12))))) && (var_1_18 == var_1_19)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9))))) && ((var_1_8 + 1) <= var_1_9)) && (var_1_9 == var_1_7)) && (((((var_1_12 / 4294967296) * 4294967296) + var_1_13) < (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) || (((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10) < (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + 2) + var_1_11)))) && (((((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1) <= (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) && ((var_1_11 + 1) <= (var_1_12 + var_1_10))) || (((var_1_11 + 1) <= (var_1_13 + var_1_10)) && ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) <= (((var_1_12 / 4294967296) * 4294967296) + var_1_13))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) [2023-11-06 23:09:01,579 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((var_1_1 == var_1_7) && (1 <= \result)) && (var_1_11 <= (var_1_13 + var_1_10))) && (var_1_18 == var_1_19)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11))) && (!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1)))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16)) || ((((((((((((((((((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1) <= (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) && ((((((var_1_10 / 4294967296) * 4294967296) + var_1_11) + (4294967295 * var_1_12)) + 1) <= (var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))))) || (((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11) + 1) <= ((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10)) && ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) <= (((var_1_12 / 4294967296) * 4294967296) + var_1_13)))) && (var_1_1 == var_1_7)) && (1 <= \result)) && (((((var_1_13 / 4294967296) * 4294967296) + var_1_12) < ((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1)) || ((var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))) < (((((var_1_10 / 4294967296) * 4294967296) + 2) + var_1_11) + (4294967295 * var_1_12))))) && (var_1_18 == var_1_19)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9))))) && ((var_1_8 + 1) <= var_1_9)) && (var_1_9 == var_1_7)) && (((((var_1_12 / 4294967296) * 4294967296) + var_1_13) < (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) || (((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10) < (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + 2) + var_1_11)))) && (((((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1) <= (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) && ((var_1_11 + 1) <= (var_1_12 + var_1_10))) || (((var_1_11 + 1) <= (var_1_13 + var_1_10)) && ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) <= (((var_1_12 / 4294967296) * 4294967296) + var_1_13))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) [2023-11-06 23:09:01,602 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:09:01,602 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:09:01,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:09:01,603 INFO L158 Benchmark]: Toolchain (without parser) took 21853.56ms. Allocated memory was 153.1MB in the beginning and 327.2MB in the end (delta: 174.1MB). Free memory was 106.9MB in the beginning and 184.6MB in the end (delta: -77.7MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,603 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:09:01,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.06ms. Allocated memory is still 153.1MB. Free memory was 106.6MB in the beginning and 94.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.16ms. Allocated memory is still 153.1MB. Free memory was 94.3MB in the beginning and 91.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,605 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 153.1MB. Free memory was 91.9MB in the beginning and 90.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,606 INFO L158 Benchmark]: RCFGBuilder took 663.95ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 74.3MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,606 INFO L158 Benchmark]: TraceAbstraction took 20589.69ms. Allocated memory was 153.1MB in the beginning and 327.2MB in the end (delta: 174.1MB). Free memory was 73.6MB in the beginning and 189.8MB in the end (delta: -116.2MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,607 INFO L158 Benchmark]: Witness Printer took 157.89ms. Allocated memory is still 327.2MB. Free memory was 189.8MB in the beginning and 184.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 23:09:01,611 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.20ms. Allocated memory is still 153.1MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.06ms. Allocated memory is still 153.1MB. Free memory was 106.6MB in the beginning and 94.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.16ms. Allocated memory is still 153.1MB. Free memory was 94.3MB in the beginning and 91.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 153.1MB. Free memory was 91.9MB in the beginning and 90.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.95ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 74.3MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20589.69ms. Allocated memory was 153.1MB in the beginning and 327.2MB in the end (delta: 174.1MB). Free memory was 73.6MB in the beginning and 189.8MB in the end (delta: -116.2MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 157.89ms. Allocated memory is still 327.2MB. Free memory was 189.8MB in the beginning and 184.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 2154 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1512 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 642 mSDtfsCounter, 458 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 110 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 166 PreInvPairs, 227 NumberOfFragments, 1024 HoareAnnotationTreeSize, 166 FomulaSimplifications, 2157 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 600 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 4953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((var_1_1 == var_1_7) && (1 <= \result)) && (var_1_11 <= (var_1_13 + var_1_10))) && (var_1_18 == var_1_19)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11))) && (!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1)))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16)) || ((((((((((((((((((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1) <= (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) && ((((((var_1_10 / 4294967296) * 4294967296) + var_1_11) + (4294967295 * var_1_12)) + 1) <= (var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))))) || (((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11) + 1) <= ((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10)) && ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) <= (((var_1_12 / 4294967296) * 4294967296) + var_1_13)))) && (var_1_1 == var_1_7)) && (1 <= \result)) && (((((var_1_13 / 4294967296) * 4294967296) + var_1_12) < ((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1)) || ((var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))) < (((((var_1_10 / 4294967296) * 4294967296) + 2) + var_1_11) + (4294967295 * var_1_12))))) && (var_1_18 == var_1_19)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9))))) && ((var_1_8 + 1) <= var_1_9)) && (var_1_9 == var_1_7)) && (((((var_1_12 / 4294967296) * 4294967296) + var_1_13) < (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) || (((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10) < (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + 2) + var_1_11)))) && (((((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1) <= (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) && ((var_1_11 + 1) <= (var_1_12 + var_1_10))) || (((var_1_11 + 1) <= (var_1_13 + var_1_10)) && ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) <= (((var_1_12 / 4294967296) * 4294967296) + var_1_13))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((var_1_1 == var_1_7) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) || ((((((((var_1_5 == ((var_1_5 / 256) * 256)) && ((16 + var_1_15) == 0)) && (((last_1_var_1_15 / 4294967296) + 1) <= 0)) && (last_1_var_1_18 == 0)) && (25 == var_1_10)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((var_1_1 == var_1_7) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:09:01,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05db4204-9e1c-4bb4-99a7-304869c3a645/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE