/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:46:29,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:46:29,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 15:46:29,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:46:29,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:46:29,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:46:29,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:46:29,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:46:29,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:46:29,532 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:46:29,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:46:29,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:46:29,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:46:29,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:46:29,534 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:46:29,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:46:29,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:46:29,535 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:46:29,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:46:29,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:46:29,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:46:29,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:46:29,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:46:29,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:46:29,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:46:29,537 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:46:29,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:46:29,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:46:29,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:46:29,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:46:29,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:46:29,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:46:29,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:46:29,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:46:29,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:46:29,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:46:29,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:46:29,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:46:29,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:46:29,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:46:29,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:46:29,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:46:29,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:46:29,542 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/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: Use bitabs translation -> true [2023-12-19 15:46:29,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:46:29,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:46:29,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:46:29,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:46:29,748 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:46:29,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2023-12-19 15:46:31,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:46:31,347 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:46:31,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2023-12-19 15:46:31,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171980761/fe1dbe458aa84f85847a23298d8507c0/FLAG1fa405516 [2023-12-19 15:46:31,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171980761/fe1dbe458aa84f85847a23298d8507c0 [2023-12-19 15:46:31,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:46:31,392 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:46:31,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:46:31,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:46:31,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:46:31,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:31,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73448df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31, skipping insertion in model container [2023-12-19 15:46:31,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:31,444 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:46:31,669 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i[916,929] [2023-12-19 15:46:31,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:46:31,809 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:46:31,824 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i[916,929] [2023-12-19 15:46:31,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:46:31,919 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:46:31,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31 WrapperNode [2023-12-19 15:46:31,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:46:31,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:46:31,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:46:31,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:46:31,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:31,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,026 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2023-12-19 15:46:32,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:46:32,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:46:32,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:46:32,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:46:32,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,118 INFO L175 MemorySlicer]: Split 141 memory accesses to 2 slices as follows [2, 139]. 99 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 19]. The 21 writes are split as follows [0, 21]. [2023-12-19 15:46:32,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:46:32,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:46:32,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:46:32,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:46:32,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (1/1) ... [2023-12-19 15:46:32,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:46:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:46:32,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 15:46:32,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 15:46:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:46:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:46:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:46:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:46:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:46:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:46:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:46:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:46:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:46:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:46:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:46:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:46:32,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:46:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:46:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:46:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:46:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:46:32,406 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:46:32,407 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:46:32,812 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:46:32,863 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:46:32,863 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:46:32,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:46:32 BoogieIcfgContainer [2023-12-19 15:46:32,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:46:32,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:46:32,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:46:32,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:46:32,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:46:31" (1/3) ... [2023-12-19 15:46:32,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd69da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:46:32, skipping insertion in model container [2023-12-19 15:46:32,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:31" (2/3) ... [2023-12-19 15:46:32,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd69da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:46:32, skipping insertion in model container [2023-12-19 15:46:32,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:46:32" (3/3) ... [2023-12-19 15:46:32,870 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2023-12-19 15:46:32,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:46:32,888 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:46:32,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:46:32,939 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@338d2eb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:46:32,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:46:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:46:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:32,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:32,954 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:32,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:32,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash -819880438, now seen corresponding path program 1 times [2023-12-19 15:46:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069525687] [2023-12-19 15:46:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069525687] [2023-12-19 15:46:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069525687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:46:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688122616] [2023-12-19 15:46:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:33,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:46:33,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:33,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:46:33,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:46:33,384 INFO L87 Difference]: Start difference. First operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 15:46:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:33,423 INFO L93 Difference]: Finished difference Result 227 states and 366 transitions. [2023-12-19 15:46:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:46:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-19 15:46:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:33,431 INFO L225 Difference]: With dead ends: 227 [2023-12-19 15:46:33,432 INFO L226 Difference]: Without dead ends: 113 [2023-12-19 15:46:33,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:46:33,437 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:33,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:46:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-19 15:46:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-19 15:46:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:46:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2023-12-19 15:46:33,476 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 179 [2023-12-19 15:46:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:33,476 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2023-12-19 15:46:33,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 15:46:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2023-12-19 15:46:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:33,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:33,484 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:33,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:46:33,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:33,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1697839694, now seen corresponding path program 1 times [2023-12-19 15:46:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:33,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205233287] [2023-12-19 15:46:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:35,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205233287] [2023-12-19 15:46:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205233287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:46:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82713201] [2023-12-19 15:46:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:35,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:46:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:46:35,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:46:35,689 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 15:46:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:36,118 INFO L93 Difference]: Finished difference Result 306 states and 452 transitions. [2023-12-19 15:46:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:46:36,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-19 15:46:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:36,124 INFO L225 Difference]: With dead ends: 306 [2023-12-19 15:46:36,124 INFO L226 Difference]: Without dead ends: 194 [2023-12-19 15:46:36,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:36,126 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:36,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 489 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:46:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-19 15:46:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2023-12-19 15:46:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.375) internal successors, (209), 153 states have internal predecessors, (209), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:46:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2023-12-19 15:46:36,163 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 179 [2023-12-19 15:46:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:36,164 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2023-12-19 15:46:36,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 15:46:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2023-12-19 15:46:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:36,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:36,173 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:36,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:46:36,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:36,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash 306146674, now seen corresponding path program 1 times [2023-12-19 15:46:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:36,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511190299] [2023-12-19 15:46:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:41,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511190299] [2023-12-19 15:46:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511190299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:46:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360392172] [2023-12-19 15:46:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:41,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:46:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:46:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:46:41,598 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand has 14 states, 9 states have (on average 6.888888888888889) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-19 15:46:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:44,114 INFO L93 Difference]: Finished difference Result 495 states and 728 transitions. [2023-12-19 15:46:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:46:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 6.888888888888889) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 179 [2023-12-19 15:46:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:44,121 INFO L225 Difference]: With dead ends: 495 [2023-12-19 15:46:44,121 INFO L226 Difference]: Without dead ends: 305 [2023-12-19 15:46:44,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:46:44,124 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 129 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:44,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1343 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-19 15:46:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-19 15:46:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 213. [2023-12-19 15:46:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3735632183908046) internal successors, (239), 175 states have internal predecessors, (239), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:46:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 311 transitions. [2023-12-19 15:46:44,149 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 311 transitions. Word has length 179 [2023-12-19 15:46:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:44,150 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 311 transitions. [2023-12-19 15:46:44,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 6.888888888888889) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-19 15:46:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 311 transitions. [2023-12-19 15:46:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:44,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:44,152 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:44,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:46:44,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:44,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash 564312112, now seen corresponding path program 1 times [2023-12-19 15:46:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500974344] [2023-12-19 15:46:44,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:44,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:46,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:46,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500974344] [2023-12-19 15:46:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500974344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:46,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:46:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872404179] [2023-12-19 15:46:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:46,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:46:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:46,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:46:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:46,316 INFO L87 Difference]: Start difference. First operand 213 states and 311 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-19 15:46:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:46,637 INFO L93 Difference]: Finished difference Result 537 states and 785 transitions. [2023-12-19 15:46:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:46:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2023-12-19 15:46:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:46,640 INFO L225 Difference]: With dead ends: 537 [2023-12-19 15:46:46,640 INFO L226 Difference]: Without dead ends: 325 [2023-12-19 15:46:46,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:46:46,642 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 112 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:46,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 647 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-19 15:46:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 229. [2023-12-19 15:46:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.3578947368421053) internal successors, (258), 191 states have internal predecessors, (258), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:46:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 330 transitions. [2023-12-19 15:46:46,659 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 330 transitions. Word has length 179 [2023-12-19 15:46:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:46,659 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 330 transitions. [2023-12-19 15:46:46,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-19 15:46:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 330 transitions. [2023-12-19 15:46:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:46,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:46,661 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:46,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:46:46,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:46,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1382797068, now seen corresponding path program 1 times [2023-12-19 15:46:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410361710] [2023-12-19 15:46:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:48,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410361710] [2023-12-19 15:46:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410361710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:46:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160701536] [2023-12-19 15:46:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:48,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:46:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:46:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:46:48,743 INFO L87 Difference]: Start difference. First operand 229 states and 330 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-19 15:46:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:49,245 INFO L93 Difference]: Finished difference Result 509 states and 734 transitions. [2023-12-19 15:46:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:46:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2023-12-19 15:46:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:49,247 INFO L225 Difference]: With dead ends: 509 [2023-12-19 15:46:49,247 INFO L226 Difference]: Without dead ends: 281 [2023-12-19 15:46:49,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:46:49,249 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 113 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:49,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1052 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:46:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-19 15:46:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 213. [2023-12-19 15:46:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:46:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2023-12-19 15:46:49,268 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 179 [2023-12-19 15:46:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:49,269 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2023-12-19 15:46:49,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-19 15:46:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2023-12-19 15:46:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:49,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:49,272 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:49,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:46:49,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:49,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 728848500, now seen corresponding path program 1 times [2023-12-19 15:46:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853860480] [2023-12-19 15:46:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853860480] [2023-12-19 15:46:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853860480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:46:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473079195] [2023-12-19 15:46:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:51,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:46:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:46:51,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:51,257 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-19 15:46:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:51,598 INFO L93 Difference]: Finished difference Result 473 states and 686 transitions. [2023-12-19 15:46:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:46:51,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2023-12-19 15:46:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:51,602 INFO L225 Difference]: With dead ends: 473 [2023-12-19 15:46:51,602 INFO L226 Difference]: Without dead ends: 261 [2023-12-19 15:46:51,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:46:51,603 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 80 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:51,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 699 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-19 15:46:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 213. [2023-12-19 15:46:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 175 states have internal predecessors, (235), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:46:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2023-12-19 15:46:51,618 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 179 [2023-12-19 15:46:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:51,619 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2023-12-19 15:46:51,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-19 15:46:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2023-12-19 15:46:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 15:46:51,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:51,620 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:46:51,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:51,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 987013938, now seen corresponding path program 1 times [2023-12-19 15:46:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901060458] [2023-12-19 15:46:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:46:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:46:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:46:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:46:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:46:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:46:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:46:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:46:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:46:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:46:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:46:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:46:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:46:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:46:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:46:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:46:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901060458] [2023-12-19 15:46:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901060458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:55,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:55,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:46:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397491896] [2023-12-19 15:46:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:46:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:55,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:46:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:46:55,550 INFO L87 Difference]: Start difference. First operand 213 states and 307 transitions. Second operand has 11 states, 8 states have (on average 7.75) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-19 15:46:56,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:56,272 INFO L93 Difference]: Finished difference Result 489 states and 700 transitions. [2023-12-19 15:46:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:46:56,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.75) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 179 [2023-12-19 15:46:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:56,274 INFO L225 Difference]: With dead ends: 489 [2023-12-19 15:46:56,274 INFO L226 Difference]: Without dead ends: 277 [2023-12-19 15:46:56,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:46:56,276 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 119 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:56,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1246 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:46:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-12-19 15:46:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2023-12-19 15:46:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 228 states have (on average 1.355263157894737) internal successors, (309), 231 states have internal predecessors, (309), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:46:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 389 transitions. [2023-12-19 15:46:56,292 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 389 transitions. Word has length 179 [2023-12-19 15:46:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:56,292 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 389 transitions. [2023-12-19 15:46:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.75) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-19 15:46:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 389 transitions. [2023-12-19 15:46:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-19 15:46:56,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:56,294 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:56,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:46:56,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:56,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1777980137, now seen corresponding path program 1 times [2023-12-19 15:46:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315359950] [2023-12-19 15:46:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:47:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:47:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:47:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:47:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:47:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:47:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:47:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:47:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:47:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:47:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:47:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:47:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:47:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:47:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:47:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:47:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:47:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:47:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:47:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:47:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:47:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:47:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:47:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:47:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:47:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-19 15:47:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:47:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315359950] [2023-12-19 15:47:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315359950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:47:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:47:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-19 15:47:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329643910] [2023-12-19 15:47:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:47:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 15:47:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:47:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 15:47:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=268, Unknown=1, NotChecked=0, Total=306 [2023-12-19 15:47:06,443 INFO L87 Difference]: Start difference. First operand 273 states and 389 transitions. Second operand has 18 states, 13 states have (on average 4.923076923076923) internal successors, (64), 18 states have internal predecessors, (64), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-19 15:47:14,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:47:15,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:47:19,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:47:24,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:47:28,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:47:54,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:48:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:48:16,829 INFO L93 Difference]: Finished difference Result 693 states and 985 transitions. [2023-12-19 15:48:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-19 15:48:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 4.923076923076923) internal successors, (64), 18 states have internal predecessors, (64), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 181 [2023-12-19 15:48:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:48:16,833 INFO L225 Difference]: With dead ends: 693 [2023-12-19 15:48:16,833 INFO L226 Difference]: Without dead ends: 421 [2023-12-19 15:48:16,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=189, Invalid=996, Unknown=5, NotChecked=0, Total=1190 [2023-12-19 15:48:16,835 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 486 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:48:16,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1619 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1303 Invalid, 2 Unknown, 0 Unchecked, 21.6s Time] [2023-12-19 15:48:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-19 15:48:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 307. [2023-12-19 15:48:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 262 states have (on average 1.3358778625954197) internal successors, (350), 265 states have internal predecessors, (350), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:48:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 430 transitions. [2023-12-19 15:48:16,852 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 430 transitions. Word has length 181 [2023-12-19 15:48:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:48:16,853 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 430 transitions. [2023-12-19 15:48:16,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 4.923076923076923) internal successors, (64), 18 states have internal predecessors, (64), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-19 15:48:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 430 transitions. [2023-12-19 15:48:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-19 15:48:16,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:48:16,855 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:48:16,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:48:16,855 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:48:16,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:48:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash -968633511, now seen corresponding path program 1 times [2023-12-19 15:48:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:48:16,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184544385] [2023-12-19 15:48:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:48:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:48:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:48:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:48:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:48:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:48:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:48:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:48:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:48:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:48:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:48:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:48:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:48:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:48:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:48:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:48:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:48:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:48:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:48:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:48:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-19 15:48:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-19 15:48:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-19 15:48:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 15:48:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 15:48:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-19 15:48:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2023-12-19 15:48:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:48:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184544385] [2023-12-19 15:48:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184544385] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:48:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510599970] [2023-12-19 15:48:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:48:18,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:48:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:48:18,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:48:18,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 15:48:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:48:19,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-19 15:48:19,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:48:19,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:48:19,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:48:19,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:19,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:19,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:19,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:19,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:19,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:19,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:19,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:20,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:20,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:20,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:20,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:20,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:20,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:20,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:20,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:20,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 15:48:20,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:48:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 34 [2023-12-19 15:48:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 344 proven. 120 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2023-12-19 15:48:20,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:48:20,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-12-19 15:48:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-19 15:48:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510599970] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:48:20,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:48:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2023-12-19 15:48:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794933376] [2023-12-19 15:48:20,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:48:20,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-19 15:48:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:48:20,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-19 15:48:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2023-12-19 15:48:20,964 INFO L87 Difference]: Start difference. First operand 307 states and 430 transitions. Second operand has 30 states, 24 states have (on average 5.875) internal successors, (141), 30 states have internal predecessors, (141), 11 states have call successors, (51), 4 states have call predecessors, (51), 8 states have return successors, (51), 5 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-19 15:48:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:48:22,224 INFO L93 Difference]: Finished difference Result 609 states and 838 transitions. [2023-12-19 15:48:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 15:48:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 5.875) internal successors, (141), 30 states have internal predecessors, (141), 11 states have call successors, (51), 4 states have call predecessors, (51), 8 states have return successors, (51), 5 states have call predecessors, (51), 11 states have call successors, (51) Word has length 181 [2023-12-19 15:48:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:48:22,227 INFO L225 Difference]: With dead ends: 609 [2023-12-19 15:48:22,227 INFO L226 Difference]: Without dead ends: 303 [2023-12-19 15:48:22,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 394 SyntacticMatches, 15 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2023-12-19 15:48:22,229 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 916 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:48:22,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 725 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 15:48:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-19 15:48:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2023-12-19 15:48:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 246 states have (on average 1.2886178861788617) internal successors, (317), 249 states have internal predecessors, (317), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:48:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 397 transitions. [2023-12-19 15:48:22,272 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 397 transitions. Word has length 181 [2023-12-19 15:48:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:48:22,272 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 397 transitions. [2023-12-19 15:48:22,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 5.875) internal successors, (141), 30 states have internal predecessors, (141), 11 states have call successors, (51), 4 states have call predecessors, (51), 8 states have return successors, (51), 5 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-19 15:48:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 397 transitions. [2023-12-19 15:48:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-19 15:48:22,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:48:22,274 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:48:22,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 15:48:22,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:48:22,486 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:48:22,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:48:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash 155132893, now seen corresponding path program 1 times [2023-12-19 15:48:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:48:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827466245] [2023-12-19 15:48:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:48:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:48:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:48:22,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:48:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:48:22,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:48:22,729 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:48:22,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:48:22,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:48:22,734 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:48:22,737 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:48:22,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:48:22 BoogieIcfgContainer [2023-12-19 15:48:22,833 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:48:22,833 INFO L158 Benchmark]: Toolchain (without parser) took 111441.93ms. Allocated memory was 260.0MB in the beginning and 921.7MB in the end (delta: 661.7MB). Free memory was 205.5MB in the beginning and 789.6MB in the end (delta: -584.1MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2023-12-19 15:48:22,834 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 205.5MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:48:22,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.44ms. Allocated memory is still 260.0MB. Free memory was 205.5MB in the beginning and 187.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 15:48:22,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.77ms. Allocated memory is still 260.0MB. Free memory was 187.2MB in the beginning and 182.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:48:22,836 INFO L158 Benchmark]: Boogie Preprocessor took 172.39ms. Allocated memory is still 260.0MB. Free memory was 181.9MB in the beginning and 176.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:48:22,836 INFO L158 Benchmark]: RCFGBuilder took 663.01ms. Allocated memory is still 260.0MB. Free memory was 176.7MB in the beginning and 219.2MB in the end (delta: -42.5MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-19 15:48:22,838 INFO L158 Benchmark]: TraceAbstraction took 109967.93ms. Allocated memory was 260.0MB in the beginning and 921.7MB in the end (delta: 661.7MB). Free memory was 218.6MB in the beginning and 789.6MB in the end (delta: -571.0MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2023-12-19 15:48:22,839 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.15ms. Allocated memory is still 205.5MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 529.44ms. Allocated memory is still 260.0MB. Free memory was 205.5MB in the beginning and 187.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 103.77ms. Allocated memory is still 260.0MB. Free memory was 187.2MB in the beginning and 182.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 172.39ms. Allocated memory is still 260.0MB. Free memory was 181.9MB in the beginning and 176.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 663.01ms. Allocated memory is still 260.0MB. Free memory was 176.7MB in the beginning and 219.2MB in the end (delta: -42.5MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 109967.93ms. Allocated memory was 260.0MB in the beginning and 921.7MB in the end (delta: 661.7MB). Free memory was 218.6MB in the beginning and 789.6MB in the end (delta: -571.0MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. * 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 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73. Possible FailurePath: [L43] unsigned char isInitial = 0; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR WrapperStruct00.var_1_4 [L68] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4) [L69] EXPR WrapperStruct00.var_1_2 [L69] unsigned short int stepLocal_0 = WrapperStruct00.var_1_2; [L70] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND FALSE !(WrapperStruct00.var_1_4 > stepLocal_0) [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] EXPR WrapperStruct00.var_1_11 [L73] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))) [L74] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L74] COND TRUE ! WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L83] EXPR WrapperStruct00.var_1_19 [L83] unsigned char stepLocal_1 = WrapperStruct00.var_1_19; [L84] EXPR WrapperStruct00.var_1_13 [L84] EXPR WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=65534, stepLocal_1=1] [L84] EXPR WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] COND FALSE !((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && stepLocal_1) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1 [L131] EXPR (WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) [L131] EXPR WrapperStruct00.var_1_7 [L131] EXPR WrapperStruct00.var_1_8 [L131] EXPR WrapperStruct00.var_1_9 [L131] EXPR WrapperStruct00.var_1_10 [L131] EXPR WrapperStruct00.var_1_11 [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 109.8s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 76.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2084 SdHoareTripleChecker+Valid, 26.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2062 mSDsluCounter, 7983 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6722 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6724 IncrementalHoareTripleChecker+Invalid, 6845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 1261 mSDtfsCounter, 6724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1084 GetRequests, 936 SyntacticMatches, 15 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 55.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=8, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 431 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 1977 NumberOfCodeBlocks, 1977 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1966 ConstructedInterpolants, 0 QuantifiedInterpolants, 16386 SizeOfPredicates, 8 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 11781/12144 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 [2023-12-19 15:48:22,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...