./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:44:48,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:44:48,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:44:48,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:44:48,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:44:48,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:44:48,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:44:48,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:44:48,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:44:48,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:44:48,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:44:48,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:44:48,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:44:48,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:44:48,797 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:44:48,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:44:48,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:44:48,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:44:48,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:44:48,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:44:48,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:44:48,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:44:48,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:44:48,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:44:48,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:44:48,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:44:48,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:44:48,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:44:48,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:44:48,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:44:48,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:44:48,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:44:48,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:44:48,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:44:48,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:44:48,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:44:48,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:44:48,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:44:48,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:44:48,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:44:48,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:44:48,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:44:48,804 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2024-10-11 07:44:49,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:44:49,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:44:49,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:44:49,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:44:49,087 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:44:49,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2024-10-11 07:44:50,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:44:50,608 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:44:50,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2024-10-11 07:44:50,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/774b1826e/d1d8ba96a8d746578c7252866e26e0b9/FLAG7f7cdbb48 [2024-10-11 07:44:50,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/774b1826e/d1d8ba96a8d746578c7252866e26e0b9 [2024-10-11 07:44:50,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:44:50,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:44:50,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:44:50,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:44:50,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:44:50,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aeb663b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50, skipping insertion in model container [2024-10-11 07:44:50,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:44:50,780 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2024-10-11 07:44:50,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:44:50,840 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:44:50,849 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2024-10-11 07:44:50,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:44:50,881 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:44:50,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50 WrapperNode [2024-10-11 07:44:50,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:44:50,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:44:50,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:44:50,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:44:50,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,920 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-10-11 07:44:50,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:44:50,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:44:50,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:44:50,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:44:50,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,956 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:44:50,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:50,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:51,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:44:51,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:44:51,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:44:51,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:44:51,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (1/1) ... [2024-10-11 07:44:51,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:44:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:44:51,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:44:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:44:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:44:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:44:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:44:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:44:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:44:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:44:51,196 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:44:51,198 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:44:51,446 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 07:44:51,447 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:44:51,485 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:44:51,486 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:44:51,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:51 BoogieIcfgContainer [2024-10-11 07:44:51,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:44:51,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:44:51,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:44:51,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:44:51,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:44:50" (1/3) ... [2024-10-11 07:44:51,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190c8d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:51, skipping insertion in model container [2024-10-11 07:44:51,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:50" (2/3) ... [2024-10-11 07:44:51,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190c8d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:51, skipping insertion in model container [2024-10-11 07:44:51,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:51" (3/3) ... [2024-10-11 07:44:51,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-51.i [2024-10-11 07:44:51,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:44:51,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:44:51,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:44:51,579 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42fdcd6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:44:51,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:44:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 07:44:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 07:44:51,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:51,593 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:51,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:51,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1138637589, now seen corresponding path program 1 times [2024-10-11 07:44:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:51,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897659303] [2024-10-11 07:44:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:44:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897659303] [2024-10-11 07:44:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897659303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:44:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:44:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:44:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118417192] [2024-10-11 07:44:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:44:51,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:44:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:51,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:44:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:44:51,982 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 07:44:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:52,022 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2024-10-11 07:44:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:44:52,029 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-10-11 07:44:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:52,037 INFO L225 Difference]: With dead ends: 119 [2024-10-11 07:44:52,037 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 07:44:52,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:44:52,044 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:52,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:44:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 07:44:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 07:44:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 07:44:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-11 07:44:52,096 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 131 [2024-10-11 07:44:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:52,096 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-11 07:44:52,097 INFO L472 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 07:44:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-11 07:44:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 07:44:52,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:52,102 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:44:52,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 395082289, now seen corresponding path program 1 times [2024-10-11 07:44:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:52,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089469094] [2024-10-11 07:44:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:44:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089469094] [2024-10-11 07:44:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089469094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:44:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:44:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:44:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832573937] [2024-10-11 07:44:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:44:52,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:44:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:52,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:44:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:44:52,642 INFO L87 Difference]: Start difference. First operand 59 states and 91 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:44:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:52,782 INFO L93 Difference]: Finished difference Result 176 states and 272 transitions. [2024-10-11 07:44:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:44:52,783 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2024-10-11 07:44:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:52,785 INFO L225 Difference]: With dead ends: 176 [2024-10-11 07:44:52,785 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 07:44:52,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:44:52,786 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:52,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 252 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:44:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 07:44:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2024-10-11 07:44:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 07:44:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2024-10-11 07:44:52,812 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 131 [2024-10-11 07:44:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:52,813 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2024-10-11 07:44:52,813 INFO L472 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:44:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2024-10-11 07:44:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 07:44:52,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:52,815 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:44:52,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash -610856372, now seen corresponding path program 1 times [2024-10-11 07:44:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585747744] [2024-10-11 07:44:52,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:44:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585747744] [2024-10-11 07:44:53,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585747744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:44:53,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:44:53,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:44:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719084392] [2024-10-11 07:44:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:44:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:44:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:44:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:44:53,316 INFO L87 Difference]: Start difference. First operand 98 states and 150 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:44:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:53,531 INFO L93 Difference]: Finished difference Result 220 states and 336 transitions. [2024-10-11 07:44:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:44:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-10-11 07:44:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:53,534 INFO L225 Difference]: With dead ends: 220 [2024-10-11 07:44:53,534 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 07:44:53,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:44:53,538 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 77 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:53,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 303 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:44:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 07:44:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2024-10-11 07:44:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-11 07:44:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2024-10-11 07:44:53,573 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 132 [2024-10-11 07:44:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:53,574 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2024-10-11 07:44:53,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:44:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2024-10-11 07:44:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 07:44:53,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:53,577 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:53,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:44:53,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 614792216, now seen corresponding path program 1 times [2024-10-11 07:44:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:53,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341485104] [2024-10-11 07:44:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:44:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341485104] [2024-10-11 07:44:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341485104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:44:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:44:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:44:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877769124] [2024-10-11 07:44:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:44:53,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:44:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:44:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:44:53,845 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 07:44:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:54,036 INFO L93 Difference]: Finished difference Result 382 states and 594 transitions. [2024-10-11 07:44:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:44:54,036 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), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2024-10-11 07:44:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:54,042 INFO L225 Difference]: With dead ends: 382 [2024-10-11 07:44:54,043 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 07:44:54,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:44:54,047 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:54,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 235 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:44:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 07:44:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2024-10-11 07:44:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 155 states have internal predecessors, (203), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 07:44:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 413 transitions. [2024-10-11 07:44:54,108 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 413 transitions. Word has length 133 [2024-10-11 07:44:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:54,108 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 413 transitions. [2024-10-11 07:44:54,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 07:44:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 413 transitions. [2024-10-11 07:44:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 07:44:54,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:54,110 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:54,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:44:54,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:54,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1294850586, now seen corresponding path program 1 times [2024-10-11 07:44:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392348949] [2024-10-11 07:44:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:44:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:54,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392348949] [2024-10-11 07:44:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392348949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:44:54,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:44:54,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:44:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951251695] [2024-10-11 07:44:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:44:54,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:44:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:44:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:44:54,272 INFO L87 Difference]: Start difference. First operand 266 states and 413 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:44:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:54,320 INFO L93 Difference]: Finished difference Result 502 states and 783 transitions. [2024-10-11 07:44:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:44:54,320 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2024-10-11 07:44:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:54,323 INFO L225 Difference]: With dead ends: 502 [2024-10-11 07:44:54,323 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 07:44:54,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:44:54,325 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:54,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:44:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 07:44:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2024-10-11 07:44:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 07:44:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions. [2024-10-11 07:44:54,369 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 133 [2024-10-11 07:44:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:54,370 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions. [2024-10-11 07:44:54,370 INFO L472 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:44:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2024-10-11 07:44:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 07:44:54,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:54,371 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:54,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:44:54,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:54,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1254013257, now seen corresponding path program 1 times [2024-10-11 07:44:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663788487] [2024-10-11 07:44:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 07:44:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663788487] [2024-10-11 07:44:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663788487] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:44:54,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726808876] [2024-10-11 07:44:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:44:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:44:54,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:44:54,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:44:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:54,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 07:44:54,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:44:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-11 07:44:54,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:44:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 07:44:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726808876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:44:54,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:44:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 07:44:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139534854] [2024-10-11 07:44:54,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:44:54,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:44:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:44:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:44:54,936 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-10-11 07:44:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:55,089 INFO L93 Difference]: Finished difference Result 410 states and 610 transitions. [2024-10-11 07:44:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:44:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 134 [2024-10-11 07:44:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:55,092 INFO L225 Difference]: With dead ends: 410 [2024-10-11 07:44:55,092 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 07:44:55,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:44:55,093 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 96 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:55,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 132 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:44:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 07:44:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 166. [2024-10-11 07:44:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-11 07:44:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 243 transitions. [2024-10-11 07:44:55,116 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 243 transitions. Word has length 134 [2024-10-11 07:44:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:55,116 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 243 transitions. [2024-10-11 07:44:55,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-10-11 07:44:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2024-10-11 07:44:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 07:44:55,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:55,118 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:55,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:44:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:44:55,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:55,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -573954887, now seen corresponding path program 1 times [2024-10-11 07:44:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145802119] [2024-10-11 07:44:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:44:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:44:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:44:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:44:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:44:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:44:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:44:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:44:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:44:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:44:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:44:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:44:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:44:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:44:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:44:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:44:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:44:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:44:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:44:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:44:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:44:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 07:44:55,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:44:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145802119] [2024-10-11 07:44:55,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145802119] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:44:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813799617] [2024-10-11 07:44:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:44:55,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:44:55,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:44:55,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:44:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:44:55,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 07:44:55,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:44:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-11 07:44:55,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:44:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 07:44:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813799617] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:44:55,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:44:55,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-11 07:44:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960025275] [2024-10-11 07:44:55,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:44:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:44:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:44:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:44:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:44:55,906 INFO L87 Difference]: Start difference. First operand 166 states and 243 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 07:44:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:44:56,455 INFO L93 Difference]: Finished difference Result 420 states and 590 transitions. [2024-10-11 07:44:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 07:44:56,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 134 [2024-10-11 07:44:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:44:56,458 INFO L225 Difference]: With dead ends: 420 [2024-10-11 07:44:56,458 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 07:44:56,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 305 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2024-10-11 07:44:56,459 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 146 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:44:56,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 435 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:44:56,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 07:44:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 260. [2024-10-11 07:44:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 149 states have (on average 1.1543624161073827) internal successors, (172), 151 states have internal predecessors, (172), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 07:44:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 366 transitions. [2024-10-11 07:44:56,498 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 366 transitions. Word has length 134 [2024-10-11 07:44:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:44:56,498 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 366 transitions. [2024-10-11 07:44:56,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 07:44:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 366 transitions. [2024-10-11 07:44:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 07:44:56,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:44:56,500 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:56,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 07:44:56,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:44:56,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:44:56,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:44:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -613111839, now seen corresponding path program 1 times [2024-10-11 07:44:56,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:44:56,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81693262] [2024-10-11 07:44:56,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:44:56,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:44:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:44:56,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:44:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:44:56,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:44:56,824 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:44:56,825 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:44:56,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:44:56,828 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:44:56,892 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:44:56,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:44:56 BoogieIcfgContainer [2024-10-11 07:44:56,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:44:56,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:44:56,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:44:56,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:44:56,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:51" (3/4) ... [2024-10-11 07:44:56,898 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:44:56,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:44:56,899 INFO L158 Benchmark]: Toolchain (without parser) took 6265.34ms. Allocated memory was 207.6MB in the beginning and 325.1MB in the end (delta: 117.4MB). Free memory was 141.2MB in the beginning and 276.5MB in the end (delta: -135.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:44:56,899 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:44:56,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.33ms. Allocated memory is still 207.6MB. Free memory was 140.9MB in the beginning and 125.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:44:56,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.30ms. Allocated memory is still 207.6MB. Free memory was 125.8MB in the beginning and 123.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:44:56,900 INFO L158 Benchmark]: Boogie Preprocessor took 78.40ms. Allocated memory is still 207.6MB. Free memory was 123.0MB in the beginning and 180.0MB in the end (delta: -57.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-11 07:44:56,900 INFO L158 Benchmark]: RCFGBuilder took 484.62ms. Allocated memory is still 207.6MB. Free memory was 180.0MB in the beginning and 156.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 07:44:56,900 INFO L158 Benchmark]: TraceAbstraction took 5407.27ms. Allocated memory was 207.6MB in the beginning and 325.1MB in the end (delta: 117.4MB). Free memory was 156.4MB in the beginning and 277.5MB in the end (delta: -121.2MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. [2024-10-11 07:44:56,900 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 325.1MB. Free memory was 277.5MB in the beginning and 276.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:44:56,901 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.13ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.33ms. Allocated memory is still 207.6MB. Free memory was 140.9MB in the beginning and 125.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.30ms. Allocated memory is still 207.6MB. Free memory was 125.8MB in the beginning and 123.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.40ms. Allocated memory is still 207.6MB. Free memory was 123.0MB in the beginning and 180.0MB in the end (delta: -57.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * RCFGBuilder took 484.62ms. Allocated memory is still 207.6MB. Free memory was 180.0MB in the beginning and 156.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5407.27ms. Allocated memory was 207.6MB in the beginning and 325.1MB in the end (delta: 117.4MB). Free memory was 156.4MB in the beginning and 277.5MB in the end (delta: -121.2MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 325.1MB. Free memory was 277.5MB in the beginning and 276.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 1627 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1016 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 700 IncrementalHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 611 mSDtfsCounter, 700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 855 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=4, InterpolantAutomatonStates: 47, 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, 268 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 2968 SizeOfPredicates, 6 NumberOfNonLiveVariables, 628 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:44:56,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:44:59,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:44:59,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:44:59,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:44:59,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:44:59,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:44:59,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:44:59,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:44:59,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:44:59,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:44:59,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:44:59,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:44:59,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:44:59,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:44:59,138 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:44:59,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:44:59,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:44:59,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:44:59,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:44:59,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:44:59,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:44:59,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:44:59,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:44:59,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:44:59,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:44:59,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:44:59,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:44:59,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:44:59,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:44:59,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:44:59,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:44:59,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:44:59,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:44:59,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:44:59,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:44:59,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:44:59,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:44:59,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:44:59,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:44:59,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:44:59,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:44:59,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:44:59,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:44:59,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:44:59,147 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:44:59,147 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2024-10-11 07:44:59,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:44:59,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:44:59,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:44:59,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:44:59,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:44:59,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2024-10-11 07:45:00,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:45:01,134 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:45:01,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2024-10-11 07:45:01,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d2868f264/7843309e3fe94efb8b98ff448067365e/FLAGc35c161e1 [2024-10-11 07:45:01,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d2868f264/7843309e3fe94efb8b98ff448067365e [2024-10-11 07:45:01,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:45:01,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:45:01,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:45:01,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:45:01,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:45:01,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d07a42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01, skipping insertion in model container [2024-10-11 07:45:01,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:45:01,305 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2024-10-11 07:45:01,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:45:01,357 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:45:01,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2024-10-11 07:45:01,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:45:01,423 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:45:01,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01 WrapperNode [2024-10-11 07:45:01,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:45:01,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:45:01,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:45:01,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:45:01,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,484 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-11 07:45:01,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:45:01,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:45:01,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:45:01,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:45:01,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:45:01,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:45:01,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:45:01,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:45:01,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:45:01,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (1/1) ... [2024-10-11 07:45:01,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:45:01,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:45:01,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:45:01,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:45:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:45:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:45:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:45:01,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:45:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:45:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:45:01,720 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:45:01,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:45:14,371 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 07:45:14,371 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:45:14,456 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:45:14,457 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:45:14,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:45:14 BoogieIcfgContainer [2024-10-11 07:45:14,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:45:14,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:45:14,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:45:14,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:45:14,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:45:01" (1/3) ... [2024-10-11 07:45:14,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@949a2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:45:14, skipping insertion in model container [2024-10-11 07:45:14,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:45:01" (2/3) ... [2024-10-11 07:45:14,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@949a2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:45:14, skipping insertion in model container [2024-10-11 07:45:14,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:45:14" (3/3) ... [2024-10-11 07:45:14,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-51.i [2024-10-11 07:45:14,507 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:45:14,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:45:14,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:45:14,641 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64bc9cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:45:14,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:45:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 07:45:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 07:45:14,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:45:14,657 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:45:14,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:45:14,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:45:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1138637589, now seen corresponding path program 1 times [2024-10-11 07:45:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:45:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824830272] [2024-10-11 07:45:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:45:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:45:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:45:14,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:45:14,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:45:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:45:15,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:45:15,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:45:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-11 07:45:15,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:45:15,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:45:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824830272] [2024-10-11 07:45:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824830272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:45:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:45:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:45:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314763339] [2024-10-11 07:45:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:45:15,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:45:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:45:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:45:15,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:45:15,490 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 07:45:19,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:45:19,767 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2024-10-11 07:45:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:45:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-10-11 07:45:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:45:19,865 INFO L225 Difference]: With dead ends: 119 [2024-10-11 07:45:19,866 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 07:45:19,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:45:19,870 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:45:19,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 07:45:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 07:45:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 07:45:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 07:45:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-11 07:45:19,904 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 131 [2024-10-11 07:45:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:45:19,904 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-11 07:45:19,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 07:45:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-11 07:45:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 07:45:19,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:45:19,908 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:45:19,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:45:20,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:45:20,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:45:20,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:45:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 395082289, now seen corresponding path program 1 times [2024-10-11 07:45:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:45:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341673401] [2024-10-11 07:45:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:45:20,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:45:20,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:45:20,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:45:20,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:45:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:45:20,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 07:45:20,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:45:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:45:23,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:45:23,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:45:23,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341673401] [2024-10-11 07:45:23,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341673401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:45:23,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:45:23,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:45:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992977619] [2024-10-11 07:45:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:45:23,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:45:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:45:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:45:23,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:45:23,584 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:45:28,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:32,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:36,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:40,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:44,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:48,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:45:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:45:52,816 INFO L93 Difference]: Finished difference Result 176 states and 272 transitions. [2024-10-11 07:45:52,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:45:52,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2024-10-11 07:45:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:45:52,910 INFO L225 Difference]: With dead ends: 176 [2024-10-11 07:45:52,910 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 07:45:52,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:45:52,912 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 64 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:45:52,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 252 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 29.1s Time] [2024-10-11 07:45:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 07:45:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2024-10-11 07:45:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 07:45:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2024-10-11 07:45:52,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 131 [2024-10-11 07:45:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:45:52,945 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2024-10-11 07:45:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:45:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2024-10-11 07:45:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 07:45:52,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:45:52,947 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:45:52,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:45:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:45:53,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:45:53,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:45:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash -610856372, now seen corresponding path program 1 times [2024-10-11 07:45:53,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:45:53,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111609069] [2024-10-11 07:45:53,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:45:53,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:45:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:45:53,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:45:53,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:45:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:45:53,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 07:45:53,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:45:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 07:45:56,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:45:56,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:45:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111609069] [2024-10-11 07:45:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111609069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:45:56,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:45:56,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:45:56,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054179359] [2024-10-11 07:45:56,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:45:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:45:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:45:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:45:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:45:56,899 INFO L87 Difference]: Start difference. First operand 98 states and 150 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 07:46:02,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:06,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:10,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:14,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:18,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:22,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:26,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:46:30,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []